./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.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 c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:06:43,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:06:43,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:06:43,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:06:43,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:06:43,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:06:43,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:06:43,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:06:43,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:06:43,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:06:43,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:06:43,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:06:43,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:06:43,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:06:43,815 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:06:43,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:06:43,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:06:43,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:06:43,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:06:43,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:06:43,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:06:43,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:06:43,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:06:43,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:06:43,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:06:43,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:06:43,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:06:43,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:06:43,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:06:43,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:06:43,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:06:43,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:06:43,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:43,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:06:43,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:06:43,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:06:43,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:06:43,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:06:43,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:06:43,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:06:43,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:06:43,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:06:43,829 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 -> c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb [2024-11-12 01:06:44,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:06:44,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:06:44,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:06:44,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:06:44,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:06:44,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2024-11-12 01:06:45,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:06:45,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:06:45,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2024-11-12 01:06:45,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0e5de87/7075e02bb7674d92b9a231b1947d3e07/FLAGf2d4abfe3 [2024-11-12 01:06:45,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0e5de87/7075e02bb7674d92b9a231b1947d3e07 [2024-11-12 01:06:45,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:06:45,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:06:45,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:45,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:06:45,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:06:45,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45, skipping insertion in model container [2024-11-12 01:06:45,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:06:45,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i[918,931] [2024-11-12 01:06:45,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:45,845 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:06:45,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i[918,931] [2024-11-12 01:06:45,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:45,913 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:06:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45 WrapperNode [2024-11-12 01:06:45,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:45,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:45,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:06:45,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:06:45,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,982 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-12 01:06:45,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:45,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:06:45,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:06:45,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:06:45,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:45,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:06:46,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:06:46,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:06:46,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:06:46,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:06:46,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (1/1) ... [2024-11-12 01:06:46,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:46,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:06:46,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:06:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:06:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:06:46,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:06:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:06:46,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:06:46,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:06:46,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:06:46,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:06:46,514 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:06:46,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:06:46,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:06:46,533 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:06:46,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:46 BoogieIcfgContainer [2024-11-12 01:06:46,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:06:46,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:06:46,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:06:46,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:06:46,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:06:45" (1/3) ... [2024-11-12 01:06:46,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a802a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:46, skipping insertion in model container [2024-11-12 01:06:46,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:45" (2/3) ... [2024-11-12 01:06:46,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a802a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:46, skipping insertion in model container [2024-11-12 01:06:46,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:46" (3/3) ... [2024-11-12 01:06:46,542 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-8.i [2024-11-12 01:06:46,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:06:46,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:06:46,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:06:46,613 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;@36c06d3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:06:46,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:06:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:06:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 01:06:46,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:46,629 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:46,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1152050323, now seen corresponding path program 1 times [2024-11-12 01:06:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007886571] [2024-11-12 01:06:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:06:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:06:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:06:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:06:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:06:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:06:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:06:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:06:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:06:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:06:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:06:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:06:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:06:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:06:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:06:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:06:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:06:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:06:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:06:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:06:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:06:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:06:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:06:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 01:06:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007886571] [2024-11-12 01:06:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007886571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:46,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:06:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604464954] [2024-11-12 01:06:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:46,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:06:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:06:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:46,996 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:06:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:47,038 INFO L93 Difference]: Finished difference Result 125 states and 223 transitions. [2024-11-12 01:06:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:06:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-12 01:06:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:47,078 INFO L225 Difference]: With dead ends: 125 [2024-11-12 01:06:47,081 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 01:06:47,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:47,092 INFO L435 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:06:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 01:06:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-12 01:06:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:06:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-11-12 01:06:47,183 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2024-11-12 01:06:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:47,184 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-11-12 01:06:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:06:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-11-12 01:06:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 01:06:47,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:47,187 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:47,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:06:47,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:47,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -144105689, now seen corresponding path program 1 times [2024-11-12 01:06:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220761607] [2024-11-12 01:06:47,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:06:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:06:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:06:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:06:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:06:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:06:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:06:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:06:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:06:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:06:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:06:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:06:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:06:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:06:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:06:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:06:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:06:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:06:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:06:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:06:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:06:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:06:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:06:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 01:06:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220761607] [2024-11-12 01:06:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220761607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:06:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714712828] [2024-11-12 01:06:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:48,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:06:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 01:06:48,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 01:06:48,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714712828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:48,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 01:06:48,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2024-11-12 01:06:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892719731] [2024-11-12 01:06:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:06:48,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:06:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:06:48,949 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:06:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:50,290 INFO L93 Difference]: Finished difference Result 397 states and 587 transitions. [2024-11-12 01:06:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-12 01:06:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-12 01:06:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:50,294 INFO L225 Difference]: With dead ends: 397 [2024-11-12 01:06:50,294 INFO L226 Difference]: Without dead ends: 338 [2024-11-12 01:06:50,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=1743, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 01:06:50,297 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 407 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:50,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 499 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:06:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-12 01:06:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 196. [2024-11-12 01:06:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 119 states have internal predecessors, (156), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-12 01:06:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2024-11-12 01:06:50,337 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 143 [2024-11-12 01:06:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2024-11-12 01:06:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:06:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2024-11-12 01:06:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 01:06:50,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:50,339 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:50,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 01:06:50,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:50,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -86847387, now seen corresponding path program 1 times [2024-11-12 01:06:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128755324] [2024-11-12 01:06:50,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:06:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44888619] [2024-11-12 01:06:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:50,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:50,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:50,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:50,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:06:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:06:51,097 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:06:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:06:51,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:06:51,192 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:06:51,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:06:51,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:06:51,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 01:06:51,398 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 01:06:51,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:06:51,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:06:51 BoogieIcfgContainer [2024-11-12 01:06:51,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:06:51,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:06:51,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:06:51,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:06:51,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:46" (3/4) ... [2024-11-12 01:06:51,492 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:06:51,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:06:51,498 INFO L158 Benchmark]: Toolchain (without parser) took 5894.78ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 80.4MB in the beginning and 222.5MB in the end (delta: -142.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:06:51,498 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:06:51,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.39ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 80.2MB in the beginning and 174.2MB in the end (delta: -94.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-12 01:06:51,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.56ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:06:51,499 INFO L158 Benchmark]: Boogie Preprocessor took 70.48ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 161.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 01:06:51,499 INFO L158 Benchmark]: RCFGBuilder took 477.36ms. Allocated memory is still 203.4MB. Free memory was 161.6MB in the beginning and 137.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 01:06:51,499 INFO L158 Benchmark]: TraceAbstraction took 4951.97ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 136.4MB in the beginning and 223.5MB in the end (delta: -87.1MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2024-11-12 01:06:51,500 INFO L158 Benchmark]: Witness Printer took 9.57ms. Allocated memory is still 262.1MB. Free memory was 223.5MB in the beginning and 222.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:06:51,504 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.17ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.39ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 80.2MB in the beginning and 174.2MB in the end (delta: -94.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.56ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.48ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 161.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 477.36ms. Allocated memory is still 203.4MB. Free memory was 161.6MB in the beginning and 137.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4951.97ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 136.4MB in the beginning and 223.5MB in the end (delta: -87.1MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. * Witness Printer took 9.57ms. Allocated memory is still 262.1MB. Free memory was 223.5MB in the beginning and 222.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L94] var_1_5 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L95] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L96] var_1_6 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L97] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L98] var_1_10 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L99] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L104] var_1_15 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L105] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L107] var_1_16 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L108] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L114] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L117] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L119] var_1_23 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L120] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L122] var_1_24 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L123] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_1=39999999987/40, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L46] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=4, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L48] COND FALSE !(var_1_10 == var_1_1) [L55] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L57] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L64] COND TRUE var_1_1 >= var_1_6 [L65] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L67] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L74] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L77] COND FALSE !((25.3 * var_1_5) != var_1_1) [L86] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=-511, var_1_13=0, var_1_15=147455, var_1_16=81919, var_1_19=383, var_1_20=-193, var_1_21=64, var_1_22=-255, var_1_23=512, var_1_24=383, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 203 mSDtfsCounter, 631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=2, InterpolantAutomatonStates: 44, 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, 2 MinimizatonAttempts, 142 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 1276 SizeOfPredicates, 4 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3033/3036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:06:51,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.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 c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:06:53,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:06:53,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:06:53,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:06:53,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:06:53,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:06:53,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:06:53,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:06:53,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:06:53,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:06:53,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:06:53,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:06:53,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:06:53,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:06:53,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:06:53,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:06:53,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:06:53,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:06:53,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:06:53,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:06:53,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:06:53,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:06:53,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:06:53,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:06:53,728 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:06:53,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:06:53,728 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:06:53,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:06:53,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:06:53,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:06:53,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:06:53,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:06:53,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:06:53,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:06:53,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:53,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:06:53,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:06:53,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:06:53,732 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:06:53,733 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:06:53,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:06:53,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:06:53,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:06:53,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:06:53,734 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 -> c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb [2024-11-12 01:06:54,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:06:54,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:06:54,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:06:54,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:06:54,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:06:54,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2024-11-12 01:06:55,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:06:55,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:06:55,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2024-11-12 01:06:55,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9a0eb74/bb563404a97045cca15afe233aac78c5/FLAGdabbcf3c0 [2024-11-12 01:06:55,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9a0eb74/bb563404a97045cca15afe233aac78c5 [2024-11-12 01:06:55,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:06:55,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:06:55,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:55,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:06:55,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:06:55,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:55" (1/1) ... [2024-11-12 01:06:55,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a77abd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:55, skipping insertion in model container [2024-11-12 01:06:55,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:55" (1/1) ... [2024-11-12 01:06:55,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:06:55,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i[918,931] [2024-11-12 01:06:55,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:55,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:06:55,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i[918,931] [2024-11-12 01:06:56,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:56,043 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:06:56,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56 WrapperNode [2024-11-12 01:06:56,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:56,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:56,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:06:56,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:06:56,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,093 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-12 01:06:56,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:56,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:06:56,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:06:56,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:06:56,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,123 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:06:56,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:06:56,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:06:56,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:06:56,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:06:56,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (1/1) ... [2024-11-12 01:06:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:56,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:06:56,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:06:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:06:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:06:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:06:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:06:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:06:56,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:06:56,322 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:06:56,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:07:16,864 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:07:16,864 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:07:16,874 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:07:16,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:07:16,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:16 BoogieIcfgContainer [2024-11-12 01:07:16,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:07:16,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:07:16,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:07:16,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:07:16,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:06:55" (1/3) ... [2024-11-12 01:07:16,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52865c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:16, skipping insertion in model container [2024-11-12 01:07:16,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:56" (2/3) ... [2024-11-12 01:07:16,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52865c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:16, skipping insertion in model container [2024-11-12 01:07:16,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:16" (3/3) ... [2024-11-12 01:07:16,885 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-8.i [2024-11-12 01:07:16,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:07:16,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:07:16,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:07:16,964 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;@5bf655cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:07:16,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:07:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:07:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 01:07:16,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:16,978 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:16,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1152050323, now seen corresponding path program 1 times [2024-11-12 01:07:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:07:16,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743551483] [2024-11-12 01:07:16,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:07:17,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:07:17,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:07:17,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:07:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:18,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:07:18,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:07:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-12 01:07:18,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:07:18,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:07:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743551483] [2024-11-12 01:07:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743551483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:07:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041439191] [2024-11-12 01:07:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:18,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:07:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:07:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:07:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:07:18,122 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:07:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:18,162 INFO L93 Difference]: Finished difference Result 125 states and 223 transitions. [2024-11-12 01:07:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:07:18,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2024-11-12 01:07:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:18,173 INFO L225 Difference]: With dead ends: 125 [2024-11-12 01:07:18,173 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 01:07:18,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:07:18,181 INFO L435 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:07:18,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:07:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 01:07:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-12 01:07:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:07:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-11-12 01:07:18,235 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2024-11-12 01:07:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-11-12 01:07:18,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:07:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-11-12 01:07:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 01:07:18,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:18,242 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:18,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:07:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:07:18,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -144105689, now seen corresponding path program 1 times [2024-11-12 01:07:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:07:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173504157] [2024-11-12 01:07:18,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:18,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:07:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:07:18,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:07:18,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:07:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:19,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 01:07:19,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:07:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 01:07:28,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:07:30,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:07:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173504157] [2024-11-12 01:07:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173504157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:07:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712707101] [2024-11-12 01:07:30,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 01:07:30,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 01:07:30,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 01:07:30,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 01:07:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:31,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 01:07:31,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:07:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 01:07:39,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:07:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712707101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:07:40,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:07:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-12 01:07:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617467504] [2024-11-12 01:07:40,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:07:40,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:07:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:07:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:07:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:07:40,116 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:07:52,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 01:07:56,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 01:08:00,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 01:08:04,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:08,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:12,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:16,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 01:08:20,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:24,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []