./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:32:48,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:32:49,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:32:49,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:32:49,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:32:49,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:32:49,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:32:49,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:32:49,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:32:49,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:32:49,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:32:49,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:32:49,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:32:49,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:32:49,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:32:49,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:32:49,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:32:49,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:32:49,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:32:49,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:32:49,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:32:49,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:32:49,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:32:49,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:32:49,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:32:49,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:32:49,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:32:49,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:32:49,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:32:49,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:32:49,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:32:49,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:32:49,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:49,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:32:49,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:32:49,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:32:49,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:32:49,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:32:49,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:32:49,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:32:49,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:32:49,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:32:49,069 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-10 03:32:49,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:32:49,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:32:49,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:32:49,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:32:49,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:32:49,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-10 03:32:50,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:32:50,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:32:50,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-10 03:32:50,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1725a9ae8/86257cea8a44444292e3e26f41045898/FLAGa4268ddc1 [2024-11-10 03:32:50,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1725a9ae8/86257cea8a44444292e3e26f41045898 [2024-11-10 03:32:50,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:32:50,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:32:50,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:50,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:32:50,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:32:50,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:50" (1/1) ... [2024-11-10 03:32:50,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4629924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:50, skipping insertion in model container [2024-11-10 03:32:50,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:50" (1/1) ... [2024-11-10 03:32:50,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:32:50,952 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_codestructure_steplocals_file-47.i[917,930] [2024-11-10 03:32:51,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:51,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:32:51,062 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_codestructure_steplocals_file-47.i[917,930] [2024-11-10 03:32:51,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:51,114 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:32:51,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51 WrapperNode [2024-11-10 03:32:51,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:51,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:51,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:32:51,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:32:51,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,172 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-10 03:32:51,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:51,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:32:51,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:32:51,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:32:51,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,214 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 03:32:51,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:32:51,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:32:51,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:32:51,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:32:51,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (1/1) ... [2024-11-10 03:32:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:51,272 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 03:32:51,299 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 03:32:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:32:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:32:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:32:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:32:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:32:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:32:51,437 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:32:51,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:32:51,758 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~bitwise22#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1; [2024-11-10 03:32:51,791 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 03:32:51,791 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:32:51,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:32:51,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:32:51,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:51 BoogieIcfgContainer [2024-11-10 03:32:51,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:32:51,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:32:51,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:32:51,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:32:51,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:32:50" (1/3) ... [2024-11-10 03:32:51,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc11d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:51, skipping insertion in model container [2024-11-10 03:32:51,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:51" (2/3) ... [2024-11-10 03:32:51,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc11d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:51, skipping insertion in model container [2024-11-10 03:32:51,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:51" (3/3) ... [2024-11-10 03:32:51,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-10 03:32:51,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:32:51,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:32:51,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:32:51,894 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;@30ece150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:32:51,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:32:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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 03:32:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 03:32:51,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:51,909 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, 1, 1, 1, 1] [2024-11-10 03:32:51,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1525312984, now seen corresponding path program 1 times [2024-11-10 03:32:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:51,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422215064] [2024-11-10 03:32:51,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:32:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:32:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:32:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:32:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:32:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:32:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:32:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:32:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:32:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:32:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:32:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:32:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:32:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:32:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:32:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:32:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:32:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:52,306 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 03:32:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422215064] [2024-11-10 03:32:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422215064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:32:52,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651529796] [2024-11-10 03:32:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:52,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:32:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:52,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:32:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:32:52,340 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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.5) internal successors, (43), 2 states have internal predecessors, (43), 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 03:32:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:52,384 INFO L93 Difference]: Finished difference Result 192 states and 327 transitions. [2024-11-10 03:32:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:32:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 170 [2024-11-10 03:32:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:52,393 INFO L225 Difference]: With dead ends: 192 [2024-11-10 03:32:52,394 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 03:32:52,401 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 03:32:52,404 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:52,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:32:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 03:32:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 03:32:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 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 03:32:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-10 03:32:52,457 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 170 [2024-11-10 03:32:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:52,458 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-10 03:32:52,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 03:32:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-10 03:32:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 03:32:52,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:52,464 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, 1, 1, 1, 1, 1] [2024-11-10 03:32:52,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:32:52,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:52,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1083704939, now seen corresponding path program 1 times [2024-11-10 03:32:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826827801] [2024-11-10 03:32:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:32:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:32:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:32:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:32:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:32:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:32:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:32:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:32:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:32:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:32:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:32:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:32:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:32:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:32:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:32:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:32:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:32:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 03:32:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826827801] [2024-11-10 03:32:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826827801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542449656] [2024-11-10 03:32:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:53,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:53,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:53,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:32:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 03:32:53,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-10 03:32:53,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:32:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 03:32:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542449656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:32:53,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:32:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-10 03:32:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779852045] [2024-11-10 03:32:53,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:32:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:32:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:32:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:32:53,780 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 03:32:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:54,590 INFO L93 Difference]: Finished difference Result 423 states and 626 transitions. [2024-11-10 03:32:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 03:32:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 171 [2024-11-10 03:32:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:54,598 INFO L225 Difference]: With dead ends: 423 [2024-11-10 03:32:54,600 INFO L226 Difference]: Without dead ends: 331 [2024-11-10 03:32:54,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-10 03:32:54,604 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 393 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:54,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 918 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:32:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-10 03:32:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 221. [2024-11-10 03:32:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 146 states have internal predecessors, (183), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 03:32:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2024-11-10 03:32:54,653 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 171 [2024-11-10 03:32:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2024-11-10 03:32:54,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 03:32:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2024-11-10 03:32:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 03:32:54,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:54,656 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, 1, 1, 1, 1, 1] [2024-11-10 03:32:54,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:32:54,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:54,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:54,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash 573170762, now seen corresponding path program 1 times [2024-11-10 03:32:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027000268] [2024-11-10 03:32:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:32:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:32:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:32:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:32:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:32:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:32:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:32:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:32:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:32:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:32:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:32:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:32:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:32:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:32:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:32:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:32:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:32:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 03:32:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027000268] [2024-11-10 03:32:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027000268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867909256] [2024-11-10 03:32:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:56,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:56,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:56,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:32:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:56,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 03:32:56,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-10 03:32:56,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:32:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 117 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-10 03:32:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867909256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:32:57,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:32:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 27 [2024-11-10 03:32:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966134287] [2024-11-10 03:32:57,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:32:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 03:32:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 03:32:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-11-10 03:32:57,333 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2024-11-10 03:33:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:00,691 INFO L93 Difference]: Finished difference Result 1107 states and 1535 transitions. [2024-11-10 03:33:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-10 03:33:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) Word has length 171 [2024-11-10 03:33:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:00,700 INFO L225 Difference]: With dead ends: 1107 [2024-11-10 03:33:00,700 INFO L226 Difference]: Without dead ends: 923 [2024-11-10 03:33:00,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=975, Invalid=3717, Unknown=0, NotChecked=0, Total=4692 [2024-11-10 03:33:00,704 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1274 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:00,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1019 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 03:33:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-10 03:33:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 419. [2024-11-10 03:33:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 299 states have (on average 1.2642140468227425) internal successors, (378), 302 states have internal predecessors, (378), 101 states have call successors, (101), 18 states have call predecessors, (101), 18 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-10 03:33:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 580 transitions. [2024-11-10 03:33:00,776 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 580 transitions. Word has length 171 [2024-11-10 03:33:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:00,776 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 580 transitions. [2024-11-10 03:33:00,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 9 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2024-11-10 03:33:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 580 transitions. [2024-11-10 03:33:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 03:33:00,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:00,779 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, 1, 1, 1, 1, 1, 1] [2024-11-10 03:33:00,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:33:00,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 03:33:00,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -182786620, now seen corresponding path program 1 times [2024-11-10 03:33:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:33:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688024682] [2024-11-10 03:33:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:33:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:33:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:33:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:33:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:33:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:33:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:33:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:33:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:33:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:33:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:33:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:33:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:33:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:33:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:33:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:33:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:33:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:33:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:33:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:33:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:33:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:33:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:33:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 03:33:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:33:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:33:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:33:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,070 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 03:33:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:33:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688024682] [2024-11-10 03:33:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688024682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:33:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:33:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:33:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134264838] [2024-11-10 03:33:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:33:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:33:01,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:33:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:33:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:33:01,074 INFO L87 Difference]: Start difference. First operand 419 states and 580 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 03:33:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:01,142 INFO L93 Difference]: Finished difference Result 1031 states and 1436 transitions. [2024-11-10 03:33:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:33:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 172 [2024-11-10 03:33:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:01,147 INFO L225 Difference]: With dead ends: 1031 [2024-11-10 03:33:01,147 INFO L226 Difference]: Without dead ends: 661 [2024-11-10 03:33:01,150 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 03:33:01,152 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 128 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:01,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 350 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:33:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-10 03:33:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 419. [2024-11-10 03:33:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 299 states have (on average 1.254180602006689) internal successors, (375), 302 states have internal predecessors, (375), 101 states have call successors, (101), 18 states have call predecessors, (101), 18 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-10 03:33:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 577 transitions. [2024-11-10 03:33:01,204 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 577 transitions. Word has length 172 [2024-11-10 03:33:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:01,205 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 577 transitions. [2024-11-10 03:33:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 03:33:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 577 transitions. [2024-11-10 03:33:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 03:33:01,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:01,209 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, 1, 1, 1, 1, 1, 1] [2024-11-10 03:33:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:33:01,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -53703901, now seen corresponding path program 1 times [2024-11-10 03:33:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:33:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987594] [2024-11-10 03:33:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:33:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:33:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293572344] [2024-11-10 03:33:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:33:01,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:33:01,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 03:33:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:01,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 03:33:01,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 295 proven. 66 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2024-11-10 03:33:01,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:33:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:33:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987594] [2024-11-10 03:33:02,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:33:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293572344] [2024-11-10 03:33:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293572344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:33:02,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:33:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-10 03:33:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151794769] [2024-11-10 03:33:02,151 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:33:02,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:33:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:33:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:33:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:33:02,154 INFO L87 Difference]: Start difference. First operand 419 states and 577 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:33:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:02,453 INFO L93 Difference]: Finished difference Result 813 states and 1120 transitions. [2024-11-10 03:33:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:33:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-10 03:33:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:02,456 INFO L225 Difference]: With dead ends: 813 [2024-11-10 03:33:02,456 INFO L226 Difference]: Without dead ends: 443 [2024-11-10 03:33:02,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:33:02,458 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 66 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:02,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 411 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:33:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-10 03:33:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 427. [2024-11-10 03:33:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 307 states have (on average 1.260586319218241) internal successors, (387), 310 states have internal predecessors, (387), 101 states have call successors, (101), 18 states have call predecessors, (101), 18 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-10 03:33:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 589 transitions. [2024-11-10 03:33:02,493 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 589 transitions. Word has length 172 [2024-11-10 03:33:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:02,494 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 589 transitions. [2024-11-10 03:33:02,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:33:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 589 transitions. [2024-11-10 03:33:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 03:33:02,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:02,496 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, 1, 1, 1, 1, 1, 1] [2024-11-10 03:33:02,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 03:33:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:02,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1689106434, now seen corresponding path program 1 times [2024-11-10 03:33:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:33:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285857407] [2024-11-10 03:33:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:33:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:33:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974961327] [2024-11-10 03:33:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:02,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:02,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:33:02,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:33:02,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 03:33:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:33:02,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:33:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:33:03,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:33:03,026 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:33:03,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:33:03,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 03:33:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:03,235 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 03:33:03,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:33:03,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:33:03 BoogieIcfgContainer [2024-11-10 03:33:03,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:33:03,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:33:03,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:33:03,322 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:33:03,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:51" (3/4) ... [2024-11-10 03:33:03,324 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:33:03,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:33:03,325 INFO L158 Benchmark]: Toolchain (without parser) took 12557.29ms. Allocated memory was 197.1MB in the beginning and 331.4MB in the end (delta: 134.2MB). Free memory was 123.9MB in the beginning and 107.5MB in the end (delta: 16.4MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.20ms. Allocated memory is still 197.1MB. Free memory was 123.7MB in the beginning and 107.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.40ms. Allocated memory is still 197.1MB. Free memory was 107.0MB in the beginning and 102.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: Boogie Preprocessor took 61.91ms. Allocated memory is still 197.1MB. Free memory was 102.2MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: IcfgBuilder took 574.38ms. Allocated memory is still 197.1MB. Free memory was 95.7MB in the beginning and 137.0MB in the end (delta: -41.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,326 INFO L158 Benchmark]: TraceAbstraction took 11508.91ms. Allocated memory was 197.1MB in the beginning and 331.4MB in the end (delta: 134.2MB). Free memory was 136.0MB in the beginning and 107.5MB in the end (delta: 28.5MB). Peak memory consumption was 164.7MB. Max. memory is 16.1GB. [2024-11-10 03:33:03,327 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 331.4MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:33:03,328 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.11ms. Allocated memory is still 197.1MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.20ms. Allocated memory is still 197.1MB. Free memory was 123.7MB in the beginning and 107.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.40ms. Allocated memory is still 197.1MB. Free memory was 107.0MB in the beginning and 102.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.91ms. Allocated memory is still 197.1MB. Free memory was 102.2MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 574.38ms. Allocated memory is still 197.1MB. Free memory was 95.7MB in the beginning and 137.0MB in the end (delta: -41.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11508.91ms. Allocated memory was 197.1MB in the beginning and 331.4MB in the end (delta: 134.2MB). Free memory was 136.0MB in the beginning and 107.5MB in the end (delta: 28.5MB). Peak memory consumption was 164.7MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 331.4MB. Free memory is still 107.5MB. 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 136, overapproximation of someBinaryFLOATComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_2 = 50.5; [L24] double var_1_3 = 0.875; [L25] unsigned short int var_1_4 = 49926; [L26] unsigned short int var_1_5 = 500; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 2; [L29] unsigned char var_1_8 = 64; [L30] unsigned short int var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 10; [L33] float var_1_12 = 0.19999999999999996; [L34] float var_1_13 = 9.2; [L35] float var_1_14 = 5.8; [L36] float var_1_15 = 31.25; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L41] unsigned short int var_1_20 = 256; [L42] unsigned short int var_1_21 = 23544; [L43] unsigned long int var_1_22 = 64; VAL [isInitial=0, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_2=101/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L96] var_1_4 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L99] var_1_5 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_7=2, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_7=2, var_1_8=64, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=2, var_1_8=64, var_1_9=5] [L104] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=2, var_1_8=64, var_1_9=5] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_8=64, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_8=64, var_1_9=5] [L107] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=5] [L107] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=5] [L108] var_1_9 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L110] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L116] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L119] var_1_14 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L121] var_1_15 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L123] var_1_17 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L125] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L130] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE var_1_2 >= (1.3 / var_1_3) [L48] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L52] signed long int stepLocal_0 = 32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))); VAL [isInitial=1, stepLocal_0=32796, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L53] COND FALSE !(var_1_5 >= stepLocal_0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L58] COND FALSE !(\read(var_1_10)) [L63] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L65] COND FALSE !((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) [L68] var_1_16 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L70] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L71] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L76] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=311294, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L77] COND TRUE var_1_6 <= stepLocal_2 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L78] COND FALSE !(\read(var_1_16)) [L81] var_1_20 = 16 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L86] EXPR 2 ^ var_1_1 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L86] EXPR (((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L86] COND FALSE !(var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L136-L137] return (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=311294, var_1_5=81919, var_1_6=98303, var_1_7=49150, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1861 mSDsluCounter, 2836 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2046 mSDsCounter, 404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2696 IncrementalHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 404 mSolverCounterUnsat, 790 mSDtfsCounter, 2696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 1105 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=5, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 872 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1714 NumberOfCodeBlocks, 1714 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1531 ConstructedInterpolants, 1 QuantifiedInterpolants, 5143 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 11292/11700 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 03:33:03,364 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_codestructure_steplocals_file-47.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 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:33:05,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:33:05,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:33:05,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:33:05,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:33:05,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:33:05,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:33:05,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:33:05,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:33:05,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:33:05,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:33:05,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:33:05,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:33:05,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:33:05,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:33:05,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:33:05,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:33:05,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:33:05,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:33:05,368 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:33:05,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:33:05,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:33:05,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:33:05,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:33:05,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:33:05,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:33:05,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:33:05,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:33:05,371 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:33:05,371 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:33:05,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:33:05,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:33:05,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:33:05,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:33:05,372 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-10 03:33:05,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:33:05,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:33:05,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:33:05,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:33:05,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:33:05,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-10 03:33:07,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:33:07,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:33:07,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-10 03:33:07,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427c40e2e/97b8742bd6ad4e8ea42b0fed6b6626c2/FLAG1344dc15e [2024-11-10 03:33:07,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427c40e2e/97b8742bd6ad4e8ea42b0fed6b6626c2 [2024-11-10 03:33:07,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:33:07,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:33:07,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:33:07,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:33:07,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:33:07,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac7147e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07, skipping insertion in model container [2024-11-10 03:33:07,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:33:07,518 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_codestructure_steplocals_file-47.i[917,930] [2024-11-10 03:33:07,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:33:07,600 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:33:07,612 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_codestructure_steplocals_file-47.i[917,930] [2024-11-10 03:33:07,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:33:07,673 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:33:07,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07 WrapperNode [2024-11-10 03:33:07,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:33:07,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:33:07,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:33:07,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:33:07,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,725 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-10 03:33:07,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:33:07,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:33:07,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:33:07,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:33:07,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,756 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 03:33:07,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:33:07,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:33:07,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:33:07,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:33:07,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:33:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:33:07,814 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 03:33:07,817 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 03:33:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:33:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:33:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:33:07,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:33:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:33:07,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:33:07,943 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:33:07,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:33:21,230 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 03:33:21,230 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:33:21,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:33:21,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:33:21,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:21 BoogieIcfgContainer [2024-11-10 03:33:21,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:33:21,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:33:21,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:33:21,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:33:21,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:33:07" (1/3) ... [2024-11-10 03:33:21,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6fceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:21, skipping insertion in model container [2024-11-10 03:33:21,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (2/3) ... [2024-11-10 03:33:21,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6fceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:21, skipping insertion in model container [2024-11-10 03:33:21,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:21" (3/3) ... [2024-11-10 03:33:21,256 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-10 03:33:21,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:33:21,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:33:21,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:33:21,325 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;@362635ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:33:21,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:33:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 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 03:33:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:33:21,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:21,340 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 03:33:21,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:21,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash 156787369, now seen corresponding path program 1 times [2024-11-10 03:33:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:33:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267624177] [2024-11-10 03:33:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:21,356 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 03:33:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:33:21,359 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 03:33:21,360 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 03:33:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:22,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:33:22,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2024-11-10 03:33:22,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:33:22,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:33:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267624177] [2024-11-10 03:33:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267624177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:33:22,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:33:22,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:33:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442181573] [2024-11-10 03:33:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:33:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:33:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:33:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:33:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:33:22,369 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 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.5) internal successors, (43), 2 states have internal predecessors, (43), 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 03:33:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:22,402 INFO L93 Difference]: Finished difference Result 146 states and 251 transitions. [2024-11-10 03:33:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:33:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 166 [2024-11-10 03:33:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:22,413 INFO L225 Difference]: With dead ends: 146 [2024-11-10 03:33:22,414 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 03:33:22,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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 03:33:22,424 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 03:33:22,425 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 03:33:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 03:33:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 03:33:22,458 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 03:33:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 03:33:22,461 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 166 [2024-11-10 03:33:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 03:33:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 03:33:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 03:33:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:33:22,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:22,469 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 03:33:22,491 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 03:33:22,669 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 03:33:22,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1355708485, now seen corresponding path program 1 times [2024-11-10 03:33:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:33:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257263290] [2024-11-10 03:33:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:22,674 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 03:33:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:33:22,677 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 03:33:22,678 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 03:33:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:23,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:33:23,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-10 03:33:24,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:33:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 03:33:26,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:33:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257263290] [2024-11-10 03:33:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257263290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:33:26,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:33:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 03:33:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71277129] [2024-11-10 03:33:26,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:33:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:33:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:33:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:33:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:33:26,872 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 03:33:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:33:38,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:33:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:43,556 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2024-11-10 03:33:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 03:33:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 166 [2024-11-10 03:33:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:43,564 INFO L225 Difference]: With dead ends: 331 [2024-11-10 03:33:43,564 INFO L226 Difference]: Without dead ends: 262 [2024-11-10 03:33:43,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-10 03:33:43,566 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 248 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 138 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:43,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 557 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 599 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2024-11-10 03:33:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-10 03:33:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 175. [2024-11-10 03:33:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 100 states have internal predecessors, (115), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 03:33:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2024-11-10 03:33:43,601 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 166 [2024-11-10 03:33:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:43,602 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2024-11-10 03:33:43,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 03:33:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2024-11-10 03:33:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:33:43,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:43,604 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 03:33:43,633 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 03:33:43,804 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 03:33:43,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -441242874, now seen corresponding path program 1 times [2024-11-10 03:33:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:33:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187677626] [2024-11-10 03:33:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:43,806 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 03:33:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:33:43,808 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 03:33:43,809 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 03:33:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:44,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 03:33:44,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-10 03:33:50,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:33:52,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:33:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187677626] [2024-11-10 03:33:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187677626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:33:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905947389] [2024-11-10 03:33:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 03:33:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 03:33:52,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 03:33:52,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 03:33:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:54,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 03:33:54,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-10 03:33:58,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:34:00,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1905947389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:34:00,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:34:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-10 03:34:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127451117] [2024-11-10 03:34:00,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:34:00,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:34:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:34:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:34:00,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:34:00,280 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 03:34:08,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:34:10,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:34:14,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:34:18,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:34:22,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []