./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_loopvsstraightlinecode_50-while_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 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:17:47,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:17:47,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:17:47,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:17:47,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:17:47,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:17:47,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:17:47,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:17:47,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:17:47,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:17:47,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:17:47,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:17:47,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:17:47,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:17:47,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:17:47,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:17:47,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:17:47,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:17:47,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:17:47,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:17:47,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:17:47,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:17:47,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:17:47,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:17:47,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:17:47,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:17:47,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:17:47,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:17:47,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:17:47,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:17:47,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:17:47,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:17:47,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:17:47,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:17:47,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:17:47,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:17:47,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:17:47,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:17:47,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:17:47,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:17:47,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:17:47,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:17:47,638 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 -> 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 [2024-11-18 23:17:47,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:17:47,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:17:47,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:17:47,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:17:47,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:17:47,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:17:49,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:17:49,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:17:49,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:17:49,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24969e8d9/3a36f55bf43e4e6693a187c7938cfa65/FLAG85d5c93f4 [2024-11-18 23:17:49,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24969e8d9/3a36f55bf43e4e6693a187c7938cfa65 [2024-11-18 23:17:49,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:17:49,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:17:49,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:17:49,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:17:49,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:17:49,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e033dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49, skipping insertion in model container [2024-11-18 23:17:49,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:17:49,690 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-11-18 23:17:49,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:17:49,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:17:49,809 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-11-18 23:17:49,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:17:49,868 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:17:49,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49 WrapperNode [2024-11-18 23:17:49,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:17:49,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:17:49,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:17:49,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:17:49,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,956 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-18 23:17:49,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:17:49,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:17:49,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:17:49,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:17:49,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:49,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,015 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-18 23:17:50,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:17:50,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:17:50,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:17:50,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:17:50,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (1/1) ... [2024-11-18 23:17:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:17:50,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:17:50,102 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-18 23:17:50,108 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-18 23:17:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:17:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:17:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:17:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:17:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:17:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:17:50,224 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:17:50,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:17:50,550 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 23:17:50,550 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:17:50,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:17:50,563 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:17:50,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:17:50 BoogieIcfgContainer [2024-11-18 23:17:50,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:17:50,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:17:50,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:17:50,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:17:50,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:17:49" (1/3) ... [2024-11-18 23:17:50,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a67669f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:17:50, skipping insertion in model container [2024-11-18 23:17:50,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:17:49" (2/3) ... [2024-11-18 23:17:50,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a67669f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:17:50, skipping insertion in model container [2024-11-18 23:17:50,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:17:50" (3/3) ... [2024-11-18 23:17:50,572 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:17:50,585 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:17:50,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:17:50,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:17:50,647 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;@6b91450e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:17:50,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:17:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 23:17:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 23:17:50,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:17:50,663 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:17:50,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:17:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:17:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1126597033, now seen corresponding path program 1 times [2024-11-18 23:17:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:17:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876624327] [2024-11-18 23:17:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:17:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 23:17:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:17:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876624327] [2024-11-18 23:17:50,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876624327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:17:50,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834758502] [2024-11-18 23:17:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:50,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:17:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:17:50,967 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-18 23:17:50,993 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-18 23:17:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:51,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:17:51,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:17:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 23:17:51,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:17:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834758502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:17:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:17:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:17:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941964306] [2024-11-18 23:17:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:17:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:17:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:17:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:17:51,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:17:51,283 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 23:17:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:17:51,314 INFO L93 Difference]: Finished difference Result 171 states and 291 transitions. [2024-11-18 23:17:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:17:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-18 23:17:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:17:51,322 INFO L225 Difference]: With dead ends: 171 [2024-11-18 23:17:51,322 INFO L226 Difference]: Without dead ends: 85 [2024-11-18 23:17:51,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-18 23:17:51,329 INFO L432 NwaCegarLoop]: 127 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, 127 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-18 23:17:51,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:17:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-18 23:17:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-18 23:17:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 23:17:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-11-18 23:17:51,368 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 140 [2024-11-18 23:17:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:17:51,369 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-11-18 23:17:51,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 23:17:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-11-18 23:17:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 23:17:51,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:17:51,374 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:17:51,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 23:17:51,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:17:51,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:17:51,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:17:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1816447203, now seen corresponding path program 1 times [2024-11-18 23:17:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:17:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776890447] [2024-11-18 23:17:51,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:17:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:17:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:17:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776890447] [2024-11-18 23:17:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776890447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:17:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:17:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:17:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504257664] [2024-11-18 23:17:52,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:17:52,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:17:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:17:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:17:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:17:52,235 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:17:52,576 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2024-11-18 23:17:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:17:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-18 23:17:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:17:52,580 INFO L225 Difference]: With dead ends: 363 [2024-11-18 23:17:52,583 INFO L226 Difference]: Without dead ends: 281 [2024-11-18 23:17:52,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:17:52,585 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 303 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:17:52,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 514 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:17:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-18 23:17:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 177. [2024-11-18 23:17:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 23:17:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2024-11-18 23:17:52,634 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 141 [2024-11-18 23:17:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:17:52,636 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2024-11-18 23:17:52,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2024-11-18 23:17:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 23:17:52,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:17:52,642 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:17:52,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:17:52,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:17:52,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:17:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash 789576351, now seen corresponding path program 1 times [2024-11-18 23:17:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:17:52,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362553712] [2024-11-18 23:17:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:17:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:17:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:17:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362553712] [2024-11-18 23:17:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362553712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:17:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:17:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:17:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265412266] [2024-11-18 23:17:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:17:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:17:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:17:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:17:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:17:53,095 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:17:53,292 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2024-11-18 23:17:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:17:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-18 23:17:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:17:53,298 INFO L225 Difference]: With dead ends: 342 [2024-11-18 23:17:53,298 INFO L226 Difference]: Without dead ends: 168 [2024-11-18 23:17:53,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:17:53,303 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:17:53,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:17:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-18 23:17:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2024-11-18 23:17:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 23:17:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-18 23:17:53,328 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 141 [2024-11-18 23:17:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:17:53,328 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-18 23:17:53,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-18 23:17:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-18 23:17:53,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:17:53,331 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:17:53,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:17:53,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:17:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:17:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1594952904, now seen corresponding path program 1 times [2024-11-18 23:17:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:17:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823717921] [2024-11-18 23:17:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:53,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:17:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:17:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:17:54,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823717921] [2024-11-18 23:17:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823717921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:17:54,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:17:54,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:17:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803919689] [2024-11-18 23:17:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:17:54,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:17:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:17:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:17:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:17:54,135 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:17:55,280 INFO L93 Difference]: Finished difference Result 402 states and 598 transitions. [2024-11-18 23:17:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:17:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-18 23:17:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:17:55,285 INFO L225 Difference]: With dead ends: 402 [2024-11-18 23:17:55,286 INFO L226 Difference]: Without dead ends: 320 [2024-11-18 23:17:55,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-18 23:17:55,288 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 219 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 23:17:55,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 520 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 23:17:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-18 23:17:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 308. [2024-11-18 23:17:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 218 states have (on average 1.298165137614679) internal successors, (283), 219 states have internal predecessors, (283), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-18 23:17:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2024-11-18 23:17:55,340 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 143 [2024-11-18 23:17:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:17:55,342 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2024-11-18 23:17:55,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:17:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2024-11-18 23:17:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 23:17:55,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:17:55,345 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:17:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:17:55,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:17:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:17:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 872076683, now seen corresponding path program 1 times [2024-11-18 23:17:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:17:55,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765706801] [2024-11-18 23:17:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:17:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-18 23:17:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:17:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765706801] [2024-11-18 23:17:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765706801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:17:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976129127] [2024-11-18 23:17:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:17:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:17:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:17:55,936 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-18 23:17:55,942 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-18 23:17:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:17:56,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 23:17:56,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:17:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-18 23:17:57,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:17:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-18 23:17:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976129127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:17:58,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:17:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-11-18 23:17:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527450819] [2024-11-18 23:17:58,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:17:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 23:17:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:17:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 23:17:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2024-11-18 23:17:58,239 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-18 23:18:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:18:03,285 INFO L93 Difference]: Finished difference Result 915 states and 1278 transitions. [2024-11-18 23:18:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-18 23:18:03,290 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 144 [2024-11-18 23:18:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:18:03,300 INFO L225 Difference]: With dead ends: 915 [2024-11-18 23:18:03,300 INFO L226 Difference]: Without dead ends: 669 [2024-11-18 23:18:03,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2656, Invalid=10000, Unknown=0, NotChecked=0, Total=12656 [2024-11-18 23:18:03,310 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1066 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-18 23:18:03,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 2053 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-18 23:18:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-18 23:18:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 384. [2024-11-18 23:18:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.3125) internal successors, (399), 305 states have internal predecessors, (399), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 23:18:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 529 transitions. [2024-11-18 23:18:03,454 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 529 transitions. Word has length 144 [2024-11-18 23:18:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:18:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 529 transitions. [2024-11-18 23:18:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-18 23:18:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 529 transitions. [2024-11-18 23:18:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 23:18:03,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:18:03,456 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:18:03,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 23:18:03,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:03,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:18:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:18:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1663097356, now seen corresponding path program 1 times [2024-11-18 23:18:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:18:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225414950] [2024-11-18 23:18:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:18:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:18:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:18:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225414950] [2024-11-18 23:18:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225414950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:18:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:18:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:18:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845763304] [2024-11-18 23:18:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:18:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:18:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:18:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:18:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:18:03,887 INFO L87 Difference]: Start difference. First operand 384 states and 529 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:18:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:18:04,041 INFO L93 Difference]: Finished difference Result 776 states and 1073 transitions. [2024-11-18 23:18:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:18:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-18 23:18:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:18:04,048 INFO L225 Difference]: With dead ends: 776 [2024-11-18 23:18:04,049 INFO L226 Difference]: Without dead ends: 601 [2024-11-18 23:18:04,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:18:04,050 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 106 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:18:04,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 437 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:18:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-18 23:18:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 418. [2024-11-18 23:18:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 339 states have internal predecessors, (438), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 23:18:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 568 transitions. [2024-11-18 23:18:04,131 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 568 transitions. Word has length 144 [2024-11-18 23:18:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:18:04,132 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 568 transitions. [2024-11-18 23:18:04,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:18:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 568 transitions. [2024-11-18 23:18:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 23:18:04,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:18:04,134 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:18:04,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 23:18:04,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:18:04,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:18:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1260780451, now seen corresponding path program 1 times [2024-11-18 23:18:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:18:04,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600936913] [2024-11-18 23:18:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:18:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 23:18:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:18:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600936913] [2024-11-18 23:18:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600936913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:18:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782787735] [2024-11-18 23:18:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:04,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:04,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:18:04,416 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-18 23:18:04,417 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-18 23:18:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:04,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 23:18:04,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:18:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 194 proven. 144 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-18 23:18:05,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:18:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 23:18:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782787735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:18:05,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:18:05,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 6] total 21 [2024-11-18 23:18:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692315363] [2024-11-18 23:18:05,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:18:05,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 23:18:05,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:18:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 23:18:05,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-18 23:18:05,926 INFO L87 Difference]: Start difference. First operand 418 states and 568 transitions. Second operand has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-18 23:18:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:18:06,515 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-11-18 23:18:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 23:18:06,515 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) Word has length 145 [2024-11-18 23:18:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:18:06,517 INFO L225 Difference]: With dead ends: 740 [2024-11-18 23:18:06,518 INFO L226 Difference]: Without dead ends: 396 [2024-11-18 23:18:06,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-18 23:18:06,519 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 377 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 23:18:06,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 778 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 23:18:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-18 23:18:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2024-11-18 23:18:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 305 states have (on average 1.278688524590164) internal successors, (390), 306 states have internal predecessors, (390), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 23:18:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2024-11-18 23:18:06,555 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 145 [2024-11-18 23:18:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:18:06,556 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2024-11-18 23:18:06,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-18 23:18:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2024-11-18 23:18:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 23:18:06,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:18:06,557 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:18:06,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 23:18:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:06,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:18:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:18:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1267294736, now seen corresponding path program 1 times [2024-11-18 23:18:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:18:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320158310] [2024-11-18 23:18:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:18:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:18:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220704934] [2024-11-18 23:18:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:18:06,811 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-18 23:18:06,812 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-18 23:18:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:06,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 23:18:06,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:18:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-18 23:18:07,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:18:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 23:18:10,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:18:10,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320158310] [2024-11-18 23:18:10,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 23:18:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220704934] [2024-11-18 23:18:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220704934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:18:10,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:18:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-18 23:18:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198720058] [2024-11-18 23:18:10,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 23:18:10,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 23:18:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:18:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 23:18:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-18 23:18:10,293 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 23:18:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:18:13,919 INFO L93 Difference]: Finished difference Result 862 states and 1165 transitions. [2024-11-18 23:18:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 23:18:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 146 [2024-11-18 23:18:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:18:13,923 INFO L225 Difference]: With dead ends: 862 [2024-11-18 23:18:13,923 INFO L226 Difference]: Without dead ends: 557 [2024-11-18 23:18:13,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2024-11-18 23:18:13,924 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 768 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 23:18:13,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 830 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 23:18:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-18 23:18:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 432. [2024-11-18 23:18:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 353 states have internal predecessors, (454), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 23:18:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 584 transitions. [2024-11-18 23:18:13,995 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 584 transitions. Word has length 146 [2024-11-18 23:18:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:18:13,995 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 584 transitions. [2024-11-18 23:18:13,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 23:18:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 584 transitions. [2024-11-18 23:18:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 23:18:13,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:18:13,997 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:18:14,013 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-18 23:18:14,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:14,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:18:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:18:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 507712626, now seen corresponding path program 1 times [2024-11-18 23:18:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:18:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740835415] [2024-11-18 23:18:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:18:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:18:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765333829] [2024-11-18 23:18:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:14,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:18:14,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:18:14,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 23:18:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:18:14,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:18:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:18:14,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:18:14,720 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:18:14,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:18:14,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-18 23:18:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:18:14,930 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:18:15,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:18:15,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:18:15 BoogieIcfgContainer [2024-11-18 23:18:15,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:18:15,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:18:15,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:18:15,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:18:15,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:17:50" (3/4) ... [2024-11-18 23:18:15,023 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:18:15,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:18:15,025 INFO L158 Benchmark]: Toolchain (without parser) took 25513.62ms. Allocated memory was 146.8MB in the beginning and 499.1MB in the end (delta: 352.3MB). Free memory was 77.0MB in the beginning and 322.1MB in the end (delta: -245.2MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,025 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 146.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:18:15,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 146.8MB. Free memory was 76.6MB in the beginning and 114.2MB in the end (delta: -37.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.04ms. Allocated memory is still 146.8MB. Free memory was 114.2MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,026 INFO L158 Benchmark]: Boogie Preprocessor took 91.14ms. Allocated memory is still 146.8MB. Free memory was 109.4MB in the beginning and 103.1MB in the end (delta: 6.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,026 INFO L158 Benchmark]: RCFGBuilder took 514.07ms. Allocated memory is still 146.8MB. Free memory was 103.1MB in the beginning and 75.3MB in the end (delta: 27.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,026 INFO L158 Benchmark]: TraceAbstraction took 24455.20ms. Allocated memory was 146.8MB in the beginning and 499.1MB in the end (delta: 352.3MB). Free memory was 74.3MB in the beginning and 323.2MB in the end (delta: -248.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,026 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 499.1MB. Free memory was 323.2MB in the beginning and 322.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:18:15,028 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 146.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 146.8MB. Free memory was 76.6MB in the beginning and 114.2MB in the end (delta: -37.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.04ms. Allocated memory is still 146.8MB. Free memory was 114.2MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.14ms. Allocated memory is still 146.8MB. Free memory was 109.4MB in the beginning and 103.1MB in the end (delta: 6.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.07ms. Allocated memory is still 146.8MB. Free memory was 103.1MB in the beginning and 75.3MB in the end (delta: 27.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24455.20ms. Allocated memory was 146.8MB in the beginning and 499.1MB in the end (delta: 352.3MB). Free memory was 74.3MB in the beginning and 323.2MB in the end (delta: -248.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 499.1MB. Free memory was 323.2MB in the beginning and 322.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 133, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of bitwiseOr at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=114686, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < 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)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= 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_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < 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)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= 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_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=114686, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2941 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2927 mSDsluCounter, 5600 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4456 mSDsCounter, 882 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4836 IncrementalHoareTripleChecker+Invalid, 5718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 882 mSolverCounterUnsat, 1144 mSDtfsCounter, 4836 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1188 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4569 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=8, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 751 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2011 NumberOfCodeBlocks, 2011 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1994 ConstructedInterpolants, 0 QuantifiedInterpolants, 11547 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1324 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 11165/11760 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-18 23:18:15,075 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_loopvsstraightlinecode_50-while_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 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:18:17,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:18:17,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:18:17,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:18:17,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:18:17,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:18:17,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:18:17,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:18:17,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:18:17,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:18:17,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:18:17,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:18:17,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:18:17,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:18:17,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:18:17,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:18:17,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:18:17,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:18:17,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:18:17,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:18:17,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:18:17,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:18:17,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:18:17,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:18:17,582 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:18:17,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:18:17,583 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:18:17,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:18:17,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:18:17,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:18:17,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:18:17,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:18:17,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:18:17,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:18:17,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:18:17,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:18:17,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:18:17,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:18:17,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:18:17,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:18:17,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:18:17,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:18:17,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:18:17,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:18:17,591 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 -> 8880d5fb97f96586e150a4d31f6d2c529a939137e2fcf1371235398ae486fc20 [2024-11-18 23:18:17,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:18:17,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:18:17,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:18:17,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:18:17,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:18:17,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:18:19,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:18:19,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:18:19,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:18:19,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae2d8c5d/bb1e18e06b144b0f989f8b0467787a01/FLAGba7cd5841 [2024-11-18 23:18:19,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae2d8c5d/bb1e18e06b144b0f989f8b0467787a01 [2024-11-18 23:18:19,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:18:19,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:18:19,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:18:19,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:18:19,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:18:19,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:19" (1/1) ... [2024-11-18 23:18:19,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456fcb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:19, skipping insertion in model container [2024-11-18 23:18:19,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:18:19" (1/1) ... [2024-11-18 23:18:19,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:18:20,178 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-11-18 23:18:20,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:18:20,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:18:20,264 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_loopvsstraightlinecode_50-while_file-47.i[915,928] [2024-11-18 23:18:20,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:18:20,316 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:18:20,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20 WrapperNode [2024-11-18 23:18:20,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:18:20,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:18:20,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:18:20,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:18:20,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,369 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-18 23:18:20,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:18:20,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:18:20,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:18:20,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:18:20,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,407 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-18 23:18:20,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:18:20,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:18:20,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:18:20,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:18:20,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (1/1) ... [2024-11-18 23:18:20,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:18:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:18:20,460 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-18 23:18:20,462 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-18 23:18:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:18:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:18:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:18:20,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:18:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:18:20,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:18:20,570 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:18:20,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:18:33,324 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 23:18:33,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:18:33,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:18:33,335 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:18:33,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:33 BoogieIcfgContainer [2024-11-18 23:18:33,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:18:33,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:18:33,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:18:33,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:18:33,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:18:19" (1/3) ... [2024-11-18 23:18:33,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:33, skipping insertion in model container [2024-11-18 23:18:33,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:18:20" (2/3) ... [2024-11-18 23:18:33,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:18:33, skipping insertion in model container [2024-11-18 23:18:33,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:18:33" (3/3) ... [2024-11-18 23:18:33,341 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-47.i [2024-11-18 23:18:33,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:18:33,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:18:33,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:18:33,419 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;@1bfd6031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:18:33,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:18:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 23:18:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 23:18:33,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:18:33,433 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:18:33,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:18:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:18:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash 742321370, now seen corresponding path program 1 times [2024-11-18 23:18:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:18:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105509996] [2024-11-18 23:18:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:33,450 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-18 23:18:33,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:18:33,456 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-18 23:18:33,460 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-18 23:18:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:34,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 23:18:34,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:18:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-18 23:18:37,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:18:37,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:18:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105509996] [2024-11-18 23:18:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105509996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:18:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [886604872] [2024-11-18 23:18:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:18:37,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 23:18:37,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 23:18:37,726 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 23:18:37,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-18 23:18:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:18:39,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 23:18:39,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:18:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:18:42,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:18:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [886604872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:18:42,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:18:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-18 23:18:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889281272] [2024-11-18 23:18:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:18:42,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:18:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:18:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:18:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:18:42,533 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:18:47,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:18:51,554 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-18 23:18:55,558 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-18 23:18:59,561 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-18 23:19:01,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:19:06,727 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-18 23:19:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:19:06,864 INFO L93 Difference]: Finished difference Result 291 states and 542 transitions. [2024-11-18 23:19:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:19:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-18 23:19:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:19:06,886 INFO L225 Difference]: With dead ends: 291 [2024-11-18 23:19:06,887 INFO L226 Difference]: Without dead ends: 228 [2024-11-18 23:19:06,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-18 23:19:06,900 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 133 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2024-11-18 23:19:06,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 472 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 23.8s Time] [2024-11-18 23:19:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-18 23:19:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2024-11-18 23:19:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 23:19:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-18 23:19:06,984 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 136 [2024-11-18 23:19:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:19:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-18 23:19:06,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 23:19:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-18 23:19:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 23:19:06,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:19:06,990 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:19:07,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 23:19:07,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:19:07,394 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-18 23:19:07,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:19:07,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:19:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash -268795880, now seen corresponding path program 1 times [2024-11-18 23:19:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:19:07,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640928319] [2024-11-18 23:19:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:19:07,399 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-18 23:19:07,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:19:07,401 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-18 23:19:07,410 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-18 23:19:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:19:08,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 23:19:08,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:19:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 23:19:16,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:19:16,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:19:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640928319] [2024-11-18 23:19:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640928319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:19:16,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:19:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:19:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753178861] [2024-11-18 23:19:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:19:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:19:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:19:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:19:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:19:16,024 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)