./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.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 b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:05:30,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:05:30,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:05:30,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:05:30,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:05:30,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:05:30,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:05:30,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:05:30,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:05:30,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:05:30,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:05:30,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:05:30,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:05:30,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:05:30,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:05:30,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:05:30,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:05:30,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:05:30,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:05:30,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:05:30,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:05:30,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:05:30,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:05:30,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:05:30,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:05:30,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:05:30,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:05:30,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:05:30,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:05:30,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:05:30,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:05:30,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:05:30,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:30,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:05:30,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:05:30,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:05:30,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:05:30,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:05:30,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:05:30,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:05:30,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:05:30,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:05:30,163 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 -> b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af [2024-11-10 04:05:30,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:05:30,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:05:30,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:05:30,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:05:30,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:05:30,478 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-48.i [2024-11-10 04:05:32,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:05:32,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:05:32,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2024-11-10 04:05:32,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988ba6cea/490436fa612d4874bc4ebd1bc589d1e8/FLAGe1312a6cf [2024-11-10 04:05:32,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988ba6cea/490436fa612d4874bc4ebd1bc589d1e8 [2024-11-10 04:05:32,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:05:32,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:05:32,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:32,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:05:32,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:05:32,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244686d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32, skipping insertion in model container [2024-11-10 04:05:32,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:05:32,577 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-48.i[915,928] [2024-11-10 04:05:32,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:32,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:05:32,692 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-48.i[915,928] [2024-11-10 04:05:32,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:32,750 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:05:32,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32 WrapperNode [2024-11-10 04:05:32,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:32,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:32,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:05:32,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:05:32,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,836 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-10 04:05:32,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:32,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:05:32,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:05:32,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:05:32,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,885 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:05:32,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:05:32,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:05:32,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:05:32,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:05:32,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (1/1) ... [2024-11-10 04:05:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:32,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:05:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:05:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:05:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:05:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:05:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:05:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:05:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:05:33,142 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:05:33,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:05:33,476 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:05:33,477 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:05:33,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:05:33,489 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:05:33,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:33 BoogieIcfgContainer [2024-11-10 04:05:33,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:05:33,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:05:33,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:05:33,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:05:33,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:05:32" (1/3) ... [2024-11-10 04:05:33,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60695e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:33, skipping insertion in model container [2024-11-10 04:05:33,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:32" (2/3) ... [2024-11-10 04:05:33,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60695e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:33, skipping insertion in model container [2024-11-10 04:05:33,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:33" (3/3) ... [2024-11-10 04:05:33,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2024-11-10 04:05:33,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:05:33,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:05:33,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:05:33,572 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;@5baddaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:05:33,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:05:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:05:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:05:33,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:33,595 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:05:33,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:33,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash 74687014, now seen corresponding path program 1 times [2024-11-10 04:05:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247058669] [2024-11-10 04:05:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:05:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:05:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:05:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 04:05:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:05:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:05:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:05:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:05:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:05:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:05:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:05:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:05:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:05:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:05:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:05:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:05:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:05:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:05:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:05:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:05:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:05:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:05:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247058669] [2024-11-10 04:05:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247058669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:05:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695182657] [2024-11-10 04:05:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:34,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:05:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:05:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:05:34,343 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:05:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:34,367 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-10 04:05:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:05:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 04:05:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:34,378 INFO L225 Difference]: With dead ends: 147 [2024-11-10 04:05:34,378 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 04:05:34,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:05:34,387 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-10 04:05:34,389 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-10 04:05:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 04:05:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 04:05:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:05:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 04:05:34,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 165 [2024-11-10 04:05:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 04:05:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:05:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 04:05:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:05:34,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:34,437 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:05:34,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:05:34,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:34,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1008933502, now seen corresponding path program 1 times [2024-11-10 04:05:34,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:34,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275927844] [2024-11-10 04:05:34,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:05:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:05:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:05:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 04:05:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:05:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:05:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:05:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:05:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:05:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:05:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:05:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:05:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:05:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:05:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:05:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:05:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:05:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:05:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:05:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:05:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:05:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:05:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275927844] [2024-11-10 04:05:34,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275927844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:34,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:34,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:05:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033126996] [2024-11-10 04:05:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:05:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:05:34,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:05:34,767 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:05:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:34,823 INFO L93 Difference]: Finished difference Result 161 states and 241 transitions. [2024-11-10 04:05:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:05:34,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 04:05:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:34,826 INFO L225 Difference]: With dead ends: 161 [2024-11-10 04:05:34,828 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 04:05:34,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:05:34,830 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:34,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:05:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 04:05:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2024-11-10 04:05:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:05:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-11-10 04:05:34,853 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 165 [2024-11-10 04:05:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:34,854 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-11-10 04:05:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:05:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-11-10 04:05:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:05:34,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:34,859 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:05:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:05:34,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:34,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash -121429821, now seen corresponding path program 1 times [2024-11-10 04:05:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115869691] [2024-11-10 04:05:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:05:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:05:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:05:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 04:05:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:05:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:05:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:05:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:05:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:05:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:05:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:05:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:05:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:05:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:05:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:05:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:05:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:05:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:05:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:05:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:05:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:05:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:05:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115869691] [2024-11-10 04:05:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115869691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:05:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827604406] [2024-11-10 04:05:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:05:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:05:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:05:35,170 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:05:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:35,222 INFO L93 Difference]: Finished difference Result 231 states and 348 transitions. [2024-11-10 04:05:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:05:35,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 04:05:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:35,225 INFO L225 Difference]: With dead ends: 231 [2024-11-10 04:05:35,229 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 04:05:35,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:05:35,231 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 50 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:35,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 204 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:05:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 04:05:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-10 04:05:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.288659793814433) internal successors, (125), 97 states have internal predecessors, (125), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:05:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 229 transitions. [2024-11-10 04:05:35,256 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 229 transitions. Word has length 165 [2024-11-10 04:05:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:35,256 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 229 transitions. [2024-11-10 04:05:35,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:05:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2024-11-10 04:05:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:05:35,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:35,258 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:05:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:05:35,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:35,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash 789618181, now seen corresponding path program 1 times [2024-11-10 04:05:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31745684] [2024-11-10 04:05:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:35,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:05:35,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:05:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:05:35,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:05:35,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:05:35,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:05:35,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:05:35,540 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 04:05:35,674 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:05:35,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:05:35 BoogieIcfgContainer [2024-11-10 04:05:35,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:05:35,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:05:35,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:05:35,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:05:35,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:33" (3/4) ... [2024-11-10 04:05:35,685 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:05:35,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:05:35,688 INFO L158 Benchmark]: Toolchain (without parser) took 3316.76ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 96.5MB in the beginning and 120.3MB in the end (delta: -23.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,688 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:05:35,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.42ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 207.9MB in the end (delta: -111.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.17ms. Allocated memory is still 239.1MB. Free memory was 207.9MB in the beginning and 204.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,690 INFO L158 Benchmark]: Boogie Preprocessor took 93.02ms. Allocated memory is still 239.1MB. Free memory was 204.8MB in the beginning and 199.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,691 INFO L158 Benchmark]: IcfgBuilder took 557.89ms. Allocated memory is still 239.1MB. Free memory was 199.5MB in the beginning and 175.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,695 INFO L158 Benchmark]: TraceAbstraction took 2189.99ms. Allocated memory is still 239.1MB. Free memory was 175.4MB in the beginning and 121.3MB in the end (delta: 54.1MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-10 04:05:35,695 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 239.1MB. Free memory was 121.3MB in the beginning and 120.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:05:35,697 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 169.9MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.42ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 207.9MB in the end (delta: -111.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.17ms. Allocated memory is still 239.1MB. Free memory was 207.9MB in the beginning and 204.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.02ms. Allocated memory is still 239.1MB. Free memory was 204.8MB in the beginning and 199.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 557.89ms. Allocated memory is still 239.1MB. Free memory was 199.5MB in the beginning and 175.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2189.99ms. Allocated memory is still 239.1MB. Free memory was 175.4MB in the beginning and 121.3MB in the end (delta: 54.1MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 239.1MB. Free memory was 121.3MB in the beginning and 120.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 163. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned short int var_1_21 = 10; [L42] signed long int var_1_22 = -256; [L43] unsigned long int var_1_23 = 256; [L44] signed long int var_1_24 = 32; [L45] signed long int var_1_25 = 32; [L46] signed char var_1_26 = -10; [L47] signed char var_1_27 = 50; [L48] signed short int var_1_28 = 8; [L49] unsigned char last_1_var_1_8 = 5; [L50] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L167] isInitial = 1 [L168] FCALL initially() [L169] COND TRUE 1 [L170] CALL updateLastVariables() [L159] last_1_var_1_8 = var_1_8 [L160] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L170] RET updateLastVariables() [L171] CALL updateVariables() [L116] var_1_2 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L117] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L118] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L118] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L119] var_1_3 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L120] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L121] var_1_4 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L122] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L123] var_1_5 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L124] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L125] var_1_6 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L126] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L127] var_1_7 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L128] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_8=5, var_1_9=307/20] [L129] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L129] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L130] var_1_9 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L131] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L132] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L132] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L133] var_1_10 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L134] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L135] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L135] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L136] var_1_11 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L137] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L138] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L138] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L140] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L141] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L141] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L145] var_1_17 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L146] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L147] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L147] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L148] var_1_21 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L149] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L150] CALL assume_abort_if_not(var_1_21 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L150] RET assume_abort_if_not(var_1_21 <= 65534) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=32, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L151] var_1_25 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L152] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L153] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L153] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=50, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L154] var_1_27 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L155] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L156] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L156] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=256, var_1_24=32, var_1_25=2147483646, var_1_26=-10, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L171] RET updateVariables() [L172] CALL step() [L54] var_1_20 = var_1_21 [L55] var_1_22 = var_1_21 [L56] var_1_23 = var_1_21 [L57] var_1_24 = var_1_25 [L58] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=8, var_1_2=0, var_1_7=0, var_1_8=5] [L59] COND TRUE var_1_26 >= -10 [L60] var_1_28 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_26)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_26))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L62] COND FALSE !(\read(var_1_2)) [L69] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L71] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=5] [L72] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L73] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L81] COND FALSE !(\read(var_1_2)) [L90] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L92] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=191, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L93] COND TRUE var_1_10 == stepLocal_1 [L94] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L98] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L101] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L104] COND FALSE !(last_1_var_1_18 != var_1_16) [L111] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L172] RET step() [L173] CALL, EXPR property() [L163-L164] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L173] RET, EXPR property() [L173] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=191, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2147483646, var_1_25=2147483646, var_1_26=-1, var_1_27=-1, var_1_28=-1, var_1_2=0, var_1_7=0, var_1_8=191] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 321 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:05:35,737 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-48.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 b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:05:38,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:05:38,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:05:38,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:05:38,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:05:38,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:05:38,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:05:38,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:05:38,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:05:38,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:05:38,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:05:38,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:05:38,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:05:38,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:05:38,147 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:05:38,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:05:38,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:05:38,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:05:38,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:05:38,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:05:38,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:05:38,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:05:38,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:05:38,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:05:38,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:05:38,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:05:38,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:05:38,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:05:38,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:05:38,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:05:38,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:05:38,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:05:38,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:05:38,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:05:38,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:38,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:05:38,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:05:38,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:05:38,159 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:05:38,159 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:05:38,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:05:38,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:05:38,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:05:38,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:05:38,160 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 -> b65d479e18f7a591496f05b34aa32ff21e8b5e47f1165cd18eedfd85d0ebf4af [2024-11-10 04:05:38,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:05:38,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:05:38,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:05:38,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:05:38,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:05:38,546 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-48.i [2024-11-10 04:05:40,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:05:40,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:05:40,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2024-11-10 04:05:40,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0d7b1e9/8fdc51b8ab9849219d3a32d3c245b5f4/FLAG70c30a446 [2024-11-10 04:05:40,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0d7b1e9/8fdc51b8ab9849219d3a32d3c245b5f4 [2024-11-10 04:05:40,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:05:40,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:05:40,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:40,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:05:40,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:05:40,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3855507f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40, skipping insertion in model container [2024-11-10 04:05:40,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:05:40,620 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-48.i[915,928] [2024-11-10 04:05:40,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:40,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:05:40,727 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-48.i[915,928] [2024-11-10 04:05:40,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:40,793 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:05:40,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40 WrapperNode [2024-11-10 04:05:40,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:40,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:40,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:05:40,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:05:40,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,852 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-10 04:05:40,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:40,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:05:40,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:05:40,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:05:40,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:05:40,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:05:40,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:05:40,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:05:40,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:05:40,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (1/1) ... [2024-11-10 04:05:40,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:40,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:40,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:05:40,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:05:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:05:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:05:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:05:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:05:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:05:41,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:05:41,117 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:05:41,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:06:05,934 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:06:05,936 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:06:05,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:06:05,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:06:05,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:06:05 BoogieIcfgContainer [2024-11-10 04:06:05,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:06:05,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:06:05,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:06:05,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:06:05,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:05:40" (1/3) ... [2024-11-10 04:06:05,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd23d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:05, skipping insertion in model container [2024-11-10 04:06:05,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:40" (2/3) ... [2024-11-10 04:06:05,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd23d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:05, skipping insertion in model container [2024-11-10 04:06:05,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:06:05" (3/3) ... [2024-11-10 04:06:05,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-48.i [2024-11-10 04:06:05,997 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:06:05,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:06:06,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:06:06,120 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;@40596b45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:06:06,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:06:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:06:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:06:06,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:06,156 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:06:06,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:06,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 74687014, now seen corresponding path program 1 times [2024-11-10 04:06:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:06,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422525887] [2024-11-10 04:06:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:06,184 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-10 04:06:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:06,189 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-10 04:06:06,204 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-10 04:06:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:07,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:06:07,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 04:06:07,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:06:07,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:06:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422525887] [2024-11-10 04:06:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422525887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:06:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:06:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:06:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696368458] [2024-11-10 04:06:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:06:07,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:06:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:06:07,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:06:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:06:07,778 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:06:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:06:07,801 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-10 04:06:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:06:07,803 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 04:06:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:06:07,810 INFO L225 Difference]: With dead ends: 147 [2024-11-10 04:06:07,810 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 04:06:07,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:06:07,816 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-10 04:06:07,817 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-10 04:06:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 04:06:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 04:06:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:06:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 04:06:07,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 165 [2024-11-10 04:06:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:06:07,862 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 04:06:07,863 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:06:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 04:06:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:06:07,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:07,867 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:06:07,907 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 04:06:08,071 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-10 04:06:08,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1008933502, now seen corresponding path program 1 times [2024-11-10 04:06:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697077662] [2024-11-10 04:06:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:08,075 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-10 04:06:08,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:08,077 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-10 04:06:08,078 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-10 04:06:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:10,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:06:10,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:06:10,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:06:10,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:06:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697077662] [2024-11-10 04:06:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697077662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:06:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:06:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:06:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765558167] [2024-11-10 04:06:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:06:10,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:06:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:06:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:06:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:06:10,354 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:06:15,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:06:19,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:06:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:06:20,172 INFO L93 Difference]: Finished difference Result 161 states and 241 transitions. [2024-11-10 04:06:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:06:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 04:06:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:06:20,177 INFO L225 Difference]: With dead ends: 161 [2024-11-10 04:06:20,177 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 04:06:20,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:06:20,179 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:06:20,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 206 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-11-10 04:06:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 04:06:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2024-11-10 04:06:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:06:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-11-10 04:06:20,201 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 165 [2024-11-10 04:06:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:06:20,207 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-11-10 04:06:20,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:06:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-11-10 04:06:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:06:20,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:20,214 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:06:20,260 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-10 04:06:20,414 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-10 04:06:20,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash -121429821, now seen corresponding path program 1 times [2024-11-10 04:06:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159959992] [2024-11-10 04:06:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:20,417 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-10 04:06:20,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:20,418 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-10 04:06:20,420 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-10 04:06:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:22,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:06:22,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:06:29,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:06:29,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:06:29,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159959992] [2024-11-10 04:06:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159959992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:06:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:06:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:06:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670194969] [2024-11-10 04:06:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:06:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:06:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:06:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:06:29,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:06:29,758 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:06:34,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:06:39,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:06:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:06:39,440 INFO L93 Difference]: Finished difference Result 231 states and 348 transitions. [2024-11-10 04:06:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:06:39,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 04:06:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:06:39,443 INFO L225 Difference]: With dead ends: 231 [2024-11-10 04:06:39,443 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 04:06:39,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:06:39,445 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:06:39,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-11-10 04:06:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 04:06:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-10 04:06:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.288659793814433) internal successors, (125), 97 states have internal predecessors, (125), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:06:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 229 transitions. [2024-11-10 04:06:39,464 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 229 transitions. Word has length 165 [2024-11-10 04:06:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:06:39,465 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 229 transitions. [2024-11-10 04:06:39,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:06:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2024-11-10 04:06:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:06:39,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:39,467 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:06:39,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 04:06:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:06:39,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 789618181, now seen corresponding path program 1 times [2024-11-10 04:06:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458302697] [2024-11-10 04:06:39,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:39,673 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-10 04:06:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:39,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:06:39,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:06:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:41,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 04:06:41,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:56,870 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 04:07:05,033 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 04:07:13,606 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)