./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.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 8c418b0c8344417842d256c30105b463d7c4d2db0994323aaa603b3ca1dc8de4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:57:44,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:57:44,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:57:44,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:57:44,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:57:44,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:57:44,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:57:44,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:57:44,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:57:44,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:57:44,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:57:44,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:57:44,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:57:44,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:57:44,230 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:57:44,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:57:44,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:57:44,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:57:44,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:57:44,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:57:44,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:57:44,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:57:44,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:57:44,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:57:44,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:57:44,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:57:44,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:57:44,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:57:44,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:57:44,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:57:44,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:57:44,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:57:44,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:57:44,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:57:44,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:57:44,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:57:44,239 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 -> 8c418b0c8344417842d256c30105b463d7c4d2db0994323aaa603b3ca1dc8de4 [2024-11-20 05:57:44,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:57:44,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:57:44,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:57:44,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:57:44,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:57:44,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:45,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:57:45,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:57:45,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:45,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb9471c6/1231b4c091e14a38ba727d629852445f/FLAG27d91716a [2024-11-20 05:57:46,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb9471c6/1231b4c091e14a38ba727d629852445f [2024-11-20 05:57:46,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:57:46,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:57:46,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:57:46,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:57:46,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:57:46,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9f5944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46, skipping insertion in model container [2024-11-20 05:57:46,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:57:46,515 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_floatingpointinfluence_has-floats_file-88.i[917,930] [2024-11-20 05:57:46,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:57:46,560 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:57:46,570 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_floatingpointinfluence_has-floats_file-88.i[917,930] [2024-11-20 05:57:46,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:57:46,602 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:57:46,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46 WrapperNode [2024-11-20 05:57:46,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:57:46,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:57:46,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:57:46,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:57:46,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,649 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-20 05:57:46,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:57:46,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:57:46,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:57:46,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:57:46,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,673 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-20 05:57:46,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:57:46,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:57:46,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:57:46,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:57:46,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (1/1) ... [2024-11-20 05:57:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:57:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:57:46,723 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-20 05:57:46,730 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-20 05:57:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:57:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:57:46,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:57:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:57:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:57:46,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:57:46,841 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:57:46,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:57:47,105 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 05:57:47,106 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:57:47,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:57:47,120 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:57:47,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:47 BoogieIcfgContainer [2024-11-20 05:57:47,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:57:47,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:57:47,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:57:47,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:57:47,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:57:46" (1/3) ... [2024-11-20 05:57:47,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7e19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:47, skipping insertion in model container [2024-11-20 05:57:47,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:46" (2/3) ... [2024-11-20 05:57:47,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7e19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:47, skipping insertion in model container [2024-11-20 05:57:47,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:47" (3/3) ... [2024-11-20 05:57:47,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:47,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:57:47,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:57:47,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:57:47,211 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;@288504b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:57:47,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:57:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 05:57:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 05:57:47,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:47,226 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:47,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:47,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash -849179731, now seen corresponding path program 1 times [2024-11-20 05:57:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:57:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498802930] [2024-11-20 05:57:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:57:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:57:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:57:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:57:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:57:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:57:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:57:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:57:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:57:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:57:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:57:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:57:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:57:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:57:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:57:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:57:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:57:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:57:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 05:57:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:57:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498802930] [2024-11-20 05:57:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498802930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:47,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:57:47,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683790359] [2024-11-20 05:57:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:57:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:57:47,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:57:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:57:47,605 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 05:57:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:47,626 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2024-11-20 05:57:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:57:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-20 05:57:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:47,644 INFO L225 Difference]: With dead ends: 109 [2024-11-20 05:57:47,646 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 05:57:47,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-20 05:57:47,651 INFO L432 NwaCegarLoop]: 79 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, 79 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-20 05:57:47,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:57:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 05:57:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 05:57:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 05:57:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-20 05:57:47,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 111 [2024-11-20 05:57:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-20 05:57:47,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 05:57:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-20 05:57:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 05:57:47,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:47,718 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:47,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:57:47,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -665723601, now seen corresponding path program 1 times [2024-11-20 05:57:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:57:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567804740] [2024-11-20 05:57:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:57:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:57:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:57:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:57:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:57:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:57:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:57:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:57:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:57:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:57:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:57:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:57:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:57:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:57:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:57:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:57:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:57:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 05:57:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:57:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567804740] [2024-11-20 05:57:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567804740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:57:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838008050] [2024-11-20 05:57:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:57:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:57:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:57:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:57:48,437 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:48,661 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-20 05:57:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:57:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-20 05:57:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:48,665 INFO L225 Difference]: With dead ends: 157 [2024-11-20 05:57:48,665 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 05:57:48,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-20 05:57:48,666 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:48,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 202 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:57:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 05:57:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2024-11-20 05:57:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 05:57:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-20 05:57:48,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 111 [2024-11-20 05:57:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-20 05:57:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-20 05:57:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:57:48,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:48,700 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:57:48,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:48,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1594133825, now seen corresponding path program 1 times [2024-11-20 05:57:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:57:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931476296] [2024-11-20 05:57:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:57:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:57:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:57:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:57:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:57:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:57:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:57:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:57:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:57:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:57:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:57:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:57:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:57:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:57:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:57:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:57:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:57:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:57:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 05:57:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:57:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931476296] [2024-11-20 05:57:49,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931476296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:49,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:49,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:57:49,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32553554] [2024-11-20 05:57:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:49,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:57:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:57:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:57:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:57:49,008 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:49,148 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2024-11-20 05:57:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:57:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-20 05:57:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:49,152 INFO L225 Difference]: With dead ends: 165 [2024-11-20 05:57:49,152 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 05:57:49,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-20 05:57:49,153 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:49,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 206 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:57:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 05:57:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-20 05:57:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 05:57:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-11-20 05:57:49,177 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 113 [2024-11-20 05:57:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:49,178 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-11-20 05:57:49,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-11-20 05:57:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:57:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:49,179 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:57:49,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1203828785, now seen corresponding path program 1 times [2024-11-20 05:57:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:57:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911667713] [2024-11-20 05:57:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:57:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:57:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:57:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:57:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:57:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:57:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:57:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:57:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:57:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:57:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:57:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:57:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:57:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:57:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:57:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:57:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:57:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:57:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 05:57:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:57:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911667713] [2024-11-20 05:57:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911667713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 05:57:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882268522] [2024-11-20 05:57:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:49,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:57:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:57:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:57:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:57:49,464 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:49,705 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-20 05:57:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:57:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-20 05:57:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:49,707 INFO L225 Difference]: With dead ends: 193 [2024-11-20 05:57:49,707 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 05:57:49,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:57:49,709 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 147 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:49,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 338 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:57:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 05:57:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 99. [2024-11-20 05:57:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 05:57:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-20 05:57:49,722 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 115 [2024-11-20 05:57:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:49,723 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-20 05:57:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-20 05:57:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:57:49,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:49,724 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:57:49,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -945663347, now seen corresponding path program 1 times [2024-11-20 05:57:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:57:49,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964611586] [2024-11-20 05:57:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:57:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:57:49,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:57:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:57:49,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:57:49,878 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:57:49,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:57:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:57:49,884 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 05:57:49,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:57:49,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:57:49 BoogieIcfgContainer [2024-11-20 05:57:49,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:57:49,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:57:49,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:57:49,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:57:49,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:47" (3/4) ... [2024-11-20 05:57:49,965 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:57:49,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:57:49,967 INFO L158 Benchmark]: Toolchain (without parser) took 3666.94ms. Allocated memory was 127.9MB in the beginning and 207.6MB in the end (delta: 79.7MB). Free memory was 58.6MB in the beginning and 111.3MB in the end (delta: -52.6MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,967 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:57:49,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.03ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 58.4MB in the beginning and 135.7MB in the end (delta: -77.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.63ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 133.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,968 INFO L158 Benchmark]: Boogie Preprocessor took 43.02ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 130.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,968 INFO L158 Benchmark]: RCFGBuilder took 426.51ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 112.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,969 INFO L158 Benchmark]: TraceAbstraction took 2837.12ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 111.5MB in the beginning and 111.3MB in the end (delta: 280.3kB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-11-20 05:57:49,969 INFO L158 Benchmark]: Witness Printer took 6.96ms. Allocated memory is still 207.6MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:57:49,971 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.03ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 58.4MB in the beginning and 135.7MB in the end (delta: -77.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.63ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 133.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.02ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 130.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.51ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 112.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2837.12ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 111.5MB in the beginning and 111.3MB in the end (delta: 280.3kB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 6.96ms. Allocated memory is still 207.6MB. Free memory is still 111.3MB. 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 103, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = -1; [L26] signed char var_1_8 = -50; [L27] signed char var_1_9 = 100; [L28] unsigned long int var_1_10 = 25; [L29] unsigned long int var_1_11 = 2568920345; [L30] unsigned long int var_1_12 = 1191097264; [L31] unsigned long int var_1_13 = 1801344522; [L32] signed long int var_1_14 = 64; [L33] signed short int var_1_15 = -16; [L34] float var_1_16 = 1000000.5; [L35] float var_1_17 = 4.5; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 128; [L38] unsigned long int last_1_var_1_10 = 25; [L39] signed short int last_1_var_1_15 = -16; [L40] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] last_1_var_1_10 = var_1_10 [L99] last_1_var_1_15 = var_1_15 [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L76] var_1_7 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L79] var_1_9 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L80] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L82] var_1_11 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L85] var_1_12 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L89] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L91] var_1_17 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L92] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L93] var_1_19 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L94] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L111] RET updateVariables() [L112] CALL step() [L44] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L44] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L53] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L56] COND TRUE var_1_12 <= var_1_8 [L57] var_1_14 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L59] var_1_15 = 2 [L60] var_1_16 = var_1_17 [L61] var_1_18 = var_1_19 [L62] unsigned char stepLocal_0 = var_1_8 < var_1_1; VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L63] COND TRUE stepLocal_0 && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7) [L64] var_1_10 = (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L103-L104] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) ? ((var_1_5 && var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed char) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : 1)) && (((var_1_8 < var_1_1) && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7)) ? (var_1_10 == ((unsigned long int) (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)))) : (var_1_10 == ((unsigned long int) (var_1_11 - var_1_13))))) && ((var_1_12 <= var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_15 == ((signed short int) 2))) && (var_1_16 == ((float) var_1_17))) && (var_1_18 == ((unsigned char) var_1_19)) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 293 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=4, InterpolantAutomatonStates: 20, 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, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 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-20 05:57:49,992 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.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 8c418b0c8344417842d256c30105b463d7c4d2db0994323aaa603b3ca1dc8de4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:57:51,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:57:51,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:57:51,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:57:51,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:57:51,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:57:51,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:57:51,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:57:51,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:57:51,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:57:51,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:57:51,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:57:51,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:57:51,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:57:51,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:57:51,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:57:51,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:57:51,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:57:51,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:57:51,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:57:51,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:57:51,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:57:51,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:57:51,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:57:51,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:57:51,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:57:51,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:57:51,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:57:51,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:57:51,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:57:51,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:57:51,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:57:51,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:57:51,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:57:51,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:57:51,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:57:51,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:57:51,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:57:51,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:57:51,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:57:51,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:57:51,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:57:51,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:57:51,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:57:51,965 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 -> 8c418b0c8344417842d256c30105b463d7c4d2db0994323aaa603b3ca1dc8de4 [2024-11-20 05:57:52,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:57:52,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:57:52,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:57:52,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:57:52,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:57:52,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:53,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:57:53,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:57:53,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:53,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e06819e/8febfd0382354792af441b3bd4fbd13d/FLAG3dc8ebd19 [2024-11-20 05:57:53,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e06819e/8febfd0382354792af441b3bd4fbd13d [2024-11-20 05:57:53,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:57:53,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:57:53,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:57:53,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:57:53,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:57:53,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:53" (1/1) ... [2024-11-20 05:57:53,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8032786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:53, skipping insertion in model container [2024-11-20 05:57:53,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:53" (1/1) ... [2024-11-20 05:57:53,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:57:54,036 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_floatingpointinfluence_has-floats_file-88.i[917,930] [2024-11-20 05:57:54,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:57:54,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:57:54,113 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_floatingpointinfluence_has-floats_file-88.i[917,930] [2024-11-20 05:57:54,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:57:54,159 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:57:54,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54 WrapperNode [2024-11-20 05:57:54,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:57:54,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:57:54,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:57:54,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:57:54,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,203 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-20 05:57:54,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:57:54,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:57:54,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:57:54,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:57:54,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,248 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-20 05:57:54,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:57:54,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:57:54,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:57:54,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:57:54,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (1/1) ... [2024-11-20 05:57:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:57:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:57:54,316 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-20 05:57:54,319 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-20 05:57:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:57:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:57:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:57:54,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:57:54,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:57:54,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:57:54,436 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:57:54,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:57:54,667 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 05:57:54,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:57:54,680 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:57:54,682 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:57:54,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:54 BoogieIcfgContainer [2024-11-20 05:57:54,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:57:54,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:57:54,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:57:54,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:57:54,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:57:53" (1/3) ... [2024-11-20 05:57:54,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c739ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:54, skipping insertion in model container [2024-11-20 05:57:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:54" (2/3) ... [2024-11-20 05:57:54,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c739ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:54, skipping insertion in model container [2024-11-20 05:57:54,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:54" (3/3) ... [2024-11-20 05:57:54,692 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-88.i [2024-11-20 05:57:54,706 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:57:54,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:57:54,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:57:54,777 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;@37d5d81a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:57:54,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:57:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 05:57:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 05:57:54,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:54,792 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:54,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -151393228, now seen corresponding path program 1 times [2024-11-20 05:57:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478485195] [2024-11-20 05:57:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:54,810 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-20 05:57:54,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:54,813 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-20 05:57:54,814 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-20 05:57:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:54,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:57:54,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:57:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-20 05:57:55,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:57:55,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:57:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478485195] [2024-11-20 05:57:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478485195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:57:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132669647] [2024-11-20 05:57:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:57:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:57:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:57:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:57:55,035 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 05:57:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:55,059 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-20 05:57:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:57:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-20 05:57:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:55,066 INFO L225 Difference]: With dead ends: 95 [2024-11-20 05:57:55,066 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 05:57:55,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-20 05:57:55,075 INFO L432 NwaCegarLoop]: 68 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, 68 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-20 05:57:55,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:57:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 05:57:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 05:57:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 05:57:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-20 05:57:55,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2024-11-20 05:57:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:55,113 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-20 05:57:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 05:57:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-20 05:57:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 05:57:55,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:55,115 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:55,124 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-20 05:57:55,316 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-20 05:57:55,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 222157298, now seen corresponding path program 1 times [2024-11-20 05:57:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64087239] [2024-11-20 05:57:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:55,318 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-20 05:57:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:55,320 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-20 05:57:55,322 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-20 05:57:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:55,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:57:55,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:57:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 05:57:55,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:57:55,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:57:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64087239] [2024-11-20 05:57:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64087239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:57:55,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:57:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:57:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102448242] [2024-11-20 05:57:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:57:55,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:57:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:57:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:57:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:57:55,684 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:55,852 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2024-11-20 05:57:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:57:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-20 05:57:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:55,858 INFO L225 Difference]: With dead ends: 158 [2024-11-20 05:57:55,858 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 05:57:55,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:57:55,861 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 84 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:55,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 254 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:57:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 05:57:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2024-11-20 05:57:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 05:57:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-20 05:57:55,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 108 [2024-11-20 05:57:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-20 05:57:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 05:57:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-20 05:57:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 05:57:55,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:55,890 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:55,896 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:57:56,091 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-20 05:57:56,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:56,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -587189328, now seen corresponding path program 1 times [2024-11-20 05:57:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520213076] [2024-11-20 05:57:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:56,096 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-20 05:57:56,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:56,097 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-20 05:57:56,117 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-20 05:57:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:56,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:57:56,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:57:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 258 proven. 15 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-20 05:57:56,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:57:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 05:57:56,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:57:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520213076] [2024-11-20 05:57:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520213076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:57:56,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:57:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-20 05:57:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609151145] [2024-11-20 05:57:56,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:57:56,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:57:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:57:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:57:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:57:56,811 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-20 05:57:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:57:57,349 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2024-11-20 05:57:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 05:57:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 108 [2024-11-20 05:57:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:57:57,353 INFO L225 Difference]: With dead ends: 242 [2024-11-20 05:57:57,353 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 05:57:57,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:57:57,354 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:57:57,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 212 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:57:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 05:57:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 157. [2024-11-20 05:57:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 90 states have internal predecessors, (103), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-20 05:57:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-11-20 05:57:57,381 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 108 [2024-11-20 05:57:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:57:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-11-20 05:57:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-20 05:57:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-11-20 05:57:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 05:57:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:57:57,383 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:57:57,389 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-20 05:57:57,587 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-20 05:57:57,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:57:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:57:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1932770606, now seen corresponding path program 1 times [2024-11-20 05:57:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:57:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997565576] [2024-11-20 05:57:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:57:57,588 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-20 05:57:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:57:57,590 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-20 05:57:57,592 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-20 05:57:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:57:57,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 05:57:57,660 INFO L278 TraceCheckSpWp]: Computing forward predicates...