./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.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 f559001327fd9c83eb4d1ac9d6d7f88804c49729dc4f0a7e747db368444227d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:36:15,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:36:15,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:36:15,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:36:15,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:36:15,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:36:15,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:36:15,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:36:15,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:36:15,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:36:15,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:36:15,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:36:15,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:36:15,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:36:15,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:36:15,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:36:15,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:36:15,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:36:15,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:36:15,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:36:15,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:36:15,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:36:15,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:36:15,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:36:15,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:36:15,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:36:15,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:36:15,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:36:15,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:15,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:36:15,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:36:15,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:36:15,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:36:15,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:36:15,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:36:15,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:36:15,577 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 -> f559001327fd9c83eb4d1ac9d6d7f88804c49729dc4f0a7e747db368444227d5 [2024-11-12 01:36:15,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:36:15,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:36:15,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:36:15,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:36:15,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:36:15,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:17,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:36:17,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:36:17,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:17,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf4e66ae/ef8104b6fe004f4c8c7149abc39b5d19/FLAG1df57d300 [2024-11-12 01:36:17,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf4e66ae/ef8104b6fe004f4c8c7149abc39b5d19 [2024-11-12 01:36:17,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:36:17,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:36:17,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:17,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:36:17,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:36:17,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:17,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc95265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17, skipping insertion in model container [2024-11-12 01:36:17,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:17,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:36:17,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i[913,926] [2024-11-12 01:36:17,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:17,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:36:17,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i[913,926] [2024-11-12 01:36:17,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:17,963 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:36:17,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17 WrapperNode [2024-11-12 01:36:17,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:17,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:17,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:36:17,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:36:17,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:17,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,001 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-12 01:36:18,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:18,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:36:18,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:36:18,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:36:18,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,025 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-12 01:36:18,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:36:18,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:36:18,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:36:18,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:36:18,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (1/1) ... [2024-11-12 01:36:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:36:18,081 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-12 01:36:18,083 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-12 01:36:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:36:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:36:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:36:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:36:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:36:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:36:18,195 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:36:18,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:36:18,455 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 01:36:18,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:36:18,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:36:18,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:36:18,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:18 BoogieIcfgContainer [2024-11-12 01:36:18,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:36:18,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:36:18,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:36:18,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:36:18,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:36:17" (1/3) ... [2024-11-12 01:36:18,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff3522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:18, skipping insertion in model container [2024-11-12 01:36:18,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:17" (2/3) ... [2024-11-12 01:36:18,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff3522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:18, skipping insertion in model container [2024-11-12 01:36:18,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:18" (3/3) ... [2024-11-12 01:36:18,476 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:18,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:36:18,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:36:18,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:36:18,533 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;@42d4f453, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:36:18,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:36:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 01:36:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 01:36:18,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:18,545 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:18,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2090058106, now seen corresponding path program 1 times [2024-11-12 01:36:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98582775] [2024-11-12 01:36:18,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:36:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:36:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:36:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:36:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:36:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:36:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:36:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:36:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:36:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 01:36:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 01:36:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 01:36:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 01:36:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:36:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 01:36:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 01:36:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98582775] [2024-11-12 01:36:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98582775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:36:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106937264] [2024-11-12 01:36:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:18,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:36:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:36:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:36:18,908 INFO L87 Difference]: Start difference. First operand has 72 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 01:36:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:18,936 INFO L93 Difference]: Finished difference Result 137 states and 226 transitions. [2024-11-12 01:36:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:36:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-12 01:36:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:18,943 INFO L225 Difference]: With dead ends: 137 [2024-11-12 01:36:18,943 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 01:36:18,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-12 01:36:18,950 INFO L435 NwaCegarLoop]: 99 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, 99 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-12 01:36:18,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:36:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 01:36:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 01:36:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 01:36:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-12 01:36:18,990 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 136 [2024-11-12 01:36:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:18,991 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-12 01:36:18,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 01:36:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-12 01:36:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 01:36:18,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:18,995 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:18,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:36:18,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:18,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 98792834, now seen corresponding path program 1 times [2024-11-12 01:36:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438442536] [2024-11-12 01:36:18,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:36:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:36:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:36:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:36:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:36:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:36:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:36:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:36:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:36:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 01:36:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 01:36:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 01:36:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 01:36:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:36:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 01:36:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 01:36:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438442536] [2024-11-12 01:36:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438442536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:36:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687220828] [2024-11-12 01:36:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:36:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:36:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:36:19,433 INFO L87 Difference]: Start difference. First operand 68 states and 99 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:19,620 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-12 01:36:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:36:19,621 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-12 01:36:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:19,624 INFO L225 Difference]: With dead ends: 218 [2024-11-12 01:36:19,625 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 01:36:19,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:36:19,626 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 119 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:19,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 317 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:36:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 01:36:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2024-11-12 01:36:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:36:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2024-11-12 01:36:19,647 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 136 [2024-11-12 01:36:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2024-11-12 01:36:19,648 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2024-11-12 01:36:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 01:36:19,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:19,650 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:36:19,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1668903680, now seen corresponding path program 1 times [2024-11-12 01:36:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973033101] [2024-11-12 01:36:19,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:36:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:36:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:36:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:36:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:36:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:36:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:36:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:36:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:36:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 01:36:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 01:36:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 01:36:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 01:36:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:36:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 01:36:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 01:36:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:20,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973033101] [2024-11-12 01:36:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973033101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:20,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:36:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993678471] [2024-11-12 01:36:20,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:20,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:36:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:20,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:36:20,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:36:20,018 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:20,135 INFO L93 Difference]: Finished difference Result 415 states and 610 transitions. [2024-11-12 01:36:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:36:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-12 01:36:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:20,139 INFO L225 Difference]: With dead ends: 415 [2024-11-12 01:36:20,141 INFO L226 Difference]: Without dead ends: 287 [2024-11-12 01:36:20,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-12 01:36:20,144 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:20,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 297 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:36:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-12 01:36:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 257. [2024-11-12 01:36:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 172 states have internal predecessors, (220), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 01:36:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2024-11-12 01:36:20,191 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 137 [2024-11-12 01:36:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:20,192 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2024-11-12 01:36:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2024-11-12 01:36:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 01:36:20,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:20,194 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:36:20,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -20040062, now seen corresponding path program 1 times [2024-11-12 01:36:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640663727] [2024-11-12 01:36:20,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:36:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:36:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:36:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:36:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:36:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:36:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:36:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:36:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 01:36:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 01:36:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 01:36:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 01:36:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 01:36:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:36:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 01:36:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 01:36:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:20,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640663727] [2024-11-12 01:36:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640663727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:20,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:36:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935796857] [2024-11-12 01:36:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:36:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:36:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:36:20,511 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:20,744 INFO L93 Difference]: Finished difference Result 661 states and 956 transitions. [2024-11-12 01:36:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:36:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-12 01:36:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:20,749 INFO L225 Difference]: With dead ends: 661 [2024-11-12 01:36:20,749 INFO L226 Difference]: Without dead ends: 533 [2024-11-12 01:36:20,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:36:20,751 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:20,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 366 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:36:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-12 01:36:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 409. [2024-11-12 01:36:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 292 states have (on average 1.3013698630136987) internal successors, (380), 296 states have internal predecessors, (380), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 01:36:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 596 transitions. [2024-11-12 01:36:20,800 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 596 transitions. Word has length 137 [2024-11-12 01:36:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 596 transitions. [2024-11-12 01:36:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 596 transitions. [2024-11-12 01:36:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 01:36:20,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:20,802 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:20,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:36:20,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 660018308, now seen corresponding path program 1 times [2024-11-12 01:36:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922103548] [2024-11-12 01:36:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:36:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591412515] [2024-11-12 01:36:20,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:36:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:36:20,859 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-12 01:36:20,860 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-12 01:36:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:36:20,988 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:36:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:36:21,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:36:21,095 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:36:21,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:36:21,112 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-12 01:36:21,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:36:21,301 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 01:36:21,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:36:21,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:36:21 BoogieIcfgContainer [2024-11-12 01:36:21,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:36:21,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:36:21,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:36:21,394 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:36:21,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:18" (3/4) ... [2024-11-12 01:36:21,396 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:36:21,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:36:21,399 INFO L158 Benchmark]: Toolchain (without parser) took 3736.22ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 118.5MB in the beginning and 181.0MB in the end (delta: -62.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:36:21,401 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:36:21,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.40ms. Allocated memory is still 186.6MB. Free memory was 118.3MB in the beginning and 153.6MB in the end (delta: -35.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-12 01:36:21,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.25ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 150.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:36:21,402 INFO L158 Benchmark]: Boogie Preprocessor took 38.22ms. Allocated memory is still 186.6MB. Free memory was 150.8MB in the beginning and 147.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:36:21,402 INFO L158 Benchmark]: RCFGBuilder took 428.16ms. Allocated memory is still 186.6MB. Free memory was 147.3MB in the beginning and 125.6MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:36:21,402 INFO L158 Benchmark]: TraceAbstraction took 2921.18ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 125.0MB in the beginning and 182.0MB in the end (delta: -57.1MB). Peak memory consumption was 619.6kB. Max. memory is 16.1GB. [2024-11-12 01:36:21,402 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 241.2MB. Free memory is still 181.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:36:21,407 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.16ms. Allocated memory is still 109.1MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.40ms. Allocated memory is still 186.6MB. Free memory was 118.3MB in the beginning and 153.6MB in the end (delta: -35.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.25ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 150.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.22ms. Allocated memory is still 186.6MB. Free memory was 150.8MB in the beginning and 147.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 428.16ms. Allocated memory is still 186.6MB. Free memory was 147.3MB in the beginning and 125.6MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2921.18ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 125.0MB in the beginning and 182.0MB in the end (delta: -57.1MB). Peak memory consumption was 619.6kB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 241.2MB. Free memory is still 181.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryFLOAToperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] signed short int last_1_var_1_12 = 2; [L44] signed long int last_1_var_1_13 = -256; [L45] double last_1_var_1_14 = 127.75; [L46] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_14 = var_1_14 [L130] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L100] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L100] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L101] var_1_9 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L102] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L104] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L106] var_1_15 = __VERIFIER_nondet_double() [L107] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L107] 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L108] var_1_17 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L109] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L110] var_1_18 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L112] var_1_19 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L113] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L114] var_1_20 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L115] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L117] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L118] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L118] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L119] var_1_24 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L120] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L121] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L121] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L122] var_1_25 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L124] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L124] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] RET updateVariables() [L142] CALL step() [L50] COND FALSE !(\read(last_1_var_1_21)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L55] COND TRUE var_1_18 > var_1_9 [L56] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L60] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L61] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L62] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L63] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L70] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L71] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L74] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L74] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L75] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L79] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L80] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L81] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L84] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L85] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L133-L134] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 1079 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 409 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 176 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 1017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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-12 01:36:21,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.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 f559001327fd9c83eb4d1ac9d6d7f88804c49729dc4f0a7e747db368444227d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:36:23,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:36:23,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:36:23,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:36:23,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:36:23,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:36:23,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:36:23,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:36:23,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:36:23,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:36:23,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:36:23,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:36:23,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:36:23,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:36:23,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:36:23,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:36:23,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:36:23,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:36:23,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:36:23,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:36:23,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:36:23,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:36:23,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:36:23,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:36:23,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:36:23,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:36:23,376 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:36:23,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:36:23,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:36:23,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:36:23,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:36:23,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:36:23,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:36:23,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:36:23,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:23,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:36:23,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:36:23,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:36:23,380 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:36:23,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:36:23,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:36:23,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:36:23,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:36:23,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:36:23,382 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 -> f559001327fd9c83eb4d1ac9d6d7f88804c49729dc4f0a7e747db368444227d5 [2024-11-12 01:36:23,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:36:23,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:36:23,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:36:23,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:36:23,650 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:36:23,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:24,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:36:25,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:36:25,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:25,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf05a9b3/e086a38be4614fac8799e648b3081060/FLAGeaa111dec [2024-11-12 01:36:25,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf05a9b3/e086a38be4614fac8799e648b3081060 [2024-11-12 01:36:25,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:36:25,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:36:25,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:25,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:36:25,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:36:25,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c5dda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25, skipping insertion in model container [2024-11-12 01:36:25,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:36:25,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i[913,926] [2024-11-12 01:36:25,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:25,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:36:25,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-35.i[913,926] [2024-11-12 01:36:25,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:25,867 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:36:25,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25 WrapperNode [2024-11-12 01:36:25,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:25,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:25,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:36:25,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:36:25,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,919 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-12 01:36:25,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:25,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:36:25,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:36:25,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:36:25,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,959 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-12 01:36:25,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:25,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:36:25,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:36:25,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:36:25,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:36:25,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (1/1) ... [2024-11-12 01:36:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:36:26,029 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-12 01:36:26,035 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-12 01:36:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:36:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:36:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:36:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:36:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:36:26,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:36:26,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:36:26,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:36:27,566 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 01:36:27,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:36:27,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:36:27,576 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:36:27,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:27 BoogieIcfgContainer [2024-11-12 01:36:27,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:36:27,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:36:27,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:36:27,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:36:27,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:36:25" (1/3) ... [2024-11-12 01:36:27,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e0ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:27, skipping insertion in model container [2024-11-12 01:36:27,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:25" (2/3) ... [2024-11-12 01:36:27,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580e0ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:27, skipping insertion in model container [2024-11-12 01:36:27,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:27" (3/3) ... [2024-11-12 01:36:27,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-35.i [2024-11-12 01:36:27,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:36:27,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:36:27,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:36:27,652 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;@79b4c88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:36:27,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:36:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 01:36:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 01:36:27,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:27,668 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:27,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:27,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1356511946, now seen corresponding path program 1 times [2024-11-12 01:36:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:36:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423703918] [2024-11-12 01:36:27,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:27,688 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-12 01:36:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:36:27,691 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-12 01:36:27,692 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-12 01:36:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:28,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:36:28,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:36:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-12 01:36:28,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:36:28,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:36:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423703918] [2024-11-12 01:36:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423703918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:28,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:36:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512601713] [2024-11-12 01:36:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:36:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:36:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:36:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:36:28,134 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 01:36:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:28,158 INFO L93 Difference]: Finished difference Result 123 states and 206 transitions. [2024-11-12 01:36:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:36:28,161 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-12 01:36:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:28,167 INFO L225 Difference]: With dead ends: 123 [2024-11-12 01:36:28,167 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 01:36:28,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-12 01:36:28,171 INFO L435 NwaCegarLoop]: 89 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, 89 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-12 01:36:28,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:36:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 01:36:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-12 01:36:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 01:36:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-12 01:36:28,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 133 [2024-11-12 01:36:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:28,210 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-12 01:36:28,211 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 01:36:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-12 01:36:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 01:36:28,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:28,216 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:28,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:36:28,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:36:28,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:28,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 891208642, now seen corresponding path program 1 times [2024-11-12 01:36:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:36:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23811437] [2024-11-12 01:36:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:28,421 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-12 01:36:28,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:36:28,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:36:28,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:36:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:28,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 01:36:28,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:36:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:29,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:36:29,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:36:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23811437] [2024-11-12 01:36:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23811437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:36:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114108320] [2024-11-12 01:36:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:36:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:36:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:36:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:36:29,047 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:30,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:36:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:31,592 INFO L93 Difference]: Finished difference Result 196 states and 288 transitions. [2024-11-12 01:36:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:36:31,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 01:36:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:31,609 INFO L225 Difference]: With dead ends: 196 [2024-11-12 01:36:31,609 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 01:36:31,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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-12 01:36:31,610 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:31,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 275 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 01:36:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 01:36:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-12 01:36:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:36:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2024-11-12 01:36:31,635 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 133 [2024-11-12 01:36:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2024-11-12 01:36:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2024-11-12 01:36:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 01:36:31,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:31,638 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:31,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:36:31,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:36:31,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash -388655036, now seen corresponding path program 1 times [2024-11-12 01:36:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:36:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883737563] [2024-11-12 01:36:31,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:31,840 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-12 01:36:31,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:36:31,842 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-12 01:36:31,843 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-12 01:36:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:32,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 01:36:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:36:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 01:36:32,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:36:32,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:36:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883737563] [2024-11-12 01:36:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883737563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:36:32,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079005024] [2024-11-12 01:36:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:32,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:36:32,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:36:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:36:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:36:32,425 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:33,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:36:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:34,460 INFO L93 Difference]: Finished difference Result 369 states and 546 transitions. [2024-11-12 01:36:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:36:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 01:36:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:34,478 INFO L225 Difference]: With dead ends: 369 [2024-11-12 01:36:34,478 INFO L226 Difference]: Without dead ends: 255 [2024-11-12 01:36:34,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:36:34,481 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 86 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:34,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 279 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 01:36:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-12 01:36:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2024-11-12 01:36:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 144 states have (on average 1.25) internal successors, (180), 144 states have internal predecessors, (180), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 01:36:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 340 transitions. [2024-11-12 01:36:34,522 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 340 transitions. Word has length 133 [2024-11-12 01:36:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 340 transitions. [2024-11-12 01:36:34,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 01:36:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 340 transitions. [2024-11-12 01:36:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 01:36:34,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:34,524 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:34,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 01:36:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:36:34,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:34,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1595659026, now seen corresponding path program 1 times [2024-11-12 01:36:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:36:34,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576839088] [2024-11-12 01:36:34,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:34,726 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-12 01:36:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:36:34,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:36:34,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 01:36:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:34,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 01:36:35,004 INFO L279 TraceCheckSpWp]: Computing forward predicates...