./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.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_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:20:04,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:20:04,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:20:04,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:20:04,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:20:04,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:20:04,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:20:04,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:20:04,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:20:04,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:20:04,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:20:04,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:20:04,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:20:04,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:20:04,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:20:04,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:20:04,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:20:04,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:20:04,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:20:04,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:20:04,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:20:04,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:20:04,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:20:04,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:20:04,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:20:04,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:20:04,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:20:04,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:20:04,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:20:04,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:20:04,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:20:04,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:20:04,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:20:04,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:20:04,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:20:04,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:20:04,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:20:04,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:20:04,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:20:04,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:20:04,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:20:04,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:20:04,563 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2024-11-12 01:20:04,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:20:04,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:20:04,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:20:04,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:20:04,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:20:04,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-12 01:20:05,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:20:06,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:20:06,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-12 01:20:06,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3344e9852/13584a031438459aa15ef7750a513e9c/FLAG8f57c07d9 [2024-11-12 01:20:06,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3344e9852/13584a031438459aa15ef7750a513e9c [2024-11-12 01:20:06,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:20:06,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:20:06,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:20:06,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:20:06,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:20:06,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345d4985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06, skipping insertion in model container [2024-11-12 01:20:06,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:20:06,698 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_normal_file-85.i[913,926] [2024-11-12 01:20:06,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:20:06,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:20:06,761 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_normal_file-85.i[913,926] [2024-11-12 01:20:06,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:20:06,798 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:20:06,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06 WrapperNode [2024-11-12 01:20:06,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:20:06,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:20:06,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:20:06,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:20:06,809 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:20:06" (1/1) ... [2024-11-12 01:20:06,822 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:20:06" (1/1) ... [2024-11-12 01:20:06,860 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-12 01:20:06,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:20:06,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:20:06,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:20:06,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:20:06,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,913 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:20:06,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:20:06,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:20:06,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:20:06,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:20:06,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (1/1) ... [2024-11-12 01:20:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:20:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:20:06,970 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:20:06,973 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:20:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:20:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:20:07,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:20:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:20:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:20:07,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:20:07,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:20:07,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:20:07,341 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:20:07,341 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:20:07,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:20:07,355 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:20:07,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:07 BoogieIcfgContainer [2024-11-12 01:20:07,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:20:07,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:20:07,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:20:07,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:20:07,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:20:06" (1/3) ... [2024-11-12 01:20:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebedba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:07, skipping insertion in model container [2024-11-12 01:20:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:06" (2/3) ... [2024-11-12 01:20:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebedba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:07, skipping insertion in model container [2024-11-12 01:20:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:07" (3/3) ... [2024-11-12 01:20:07,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2024-11-12 01:20:07,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:20:07,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:20:07,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:20:07,448 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;@20d3a87e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:20:07,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:20:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 01:20:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:07,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:07,464 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1085262619, now seen corresponding path program 1 times [2024-11-12 01:20:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:20:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594641816] [2024-11-12 01:20:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:20:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:20:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:20:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:20:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:20:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:20:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:20:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:20:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:20:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:20:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:20:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:20:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:20:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:20:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 01:20:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:20:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:20:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:20:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:20:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:20:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:20:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:20:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:20:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 01:20:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:20:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594641816] [2024-11-12 01:20:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594641816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:20:07,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:20:07,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:20:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719699077] [2024-11-12 01:20:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:20:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:20:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:20:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:20:07,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:20:07,854 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 01:20:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:20:07,874 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-12 01:20:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:20:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 01:20:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:20:07,881 INFO L225 Difference]: With dead ends: 119 [2024-11-12 01:20:07,883 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 01:20:07,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:20:07,890 INFO L435 NwaCegarLoop]: 85 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, 85 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:20:07,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:20:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 01:20:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 01:20:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 01:20:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-12 01:20:07,967 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-12 01:20:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:20:07,967 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-12 01:20:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 01:20:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-12 01:20:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:07,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:07,972 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:20:07,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:07,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2074053391, now seen corresponding path program 1 times [2024-11-12 01:20:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:20:07,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689615959] [2024-11-12 01:20:07,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:20:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:20:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:20:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:20:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:20:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:20:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:20:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:20:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:20:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:20:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:20:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:20:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:20:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:20:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 01:20:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:20:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:20:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:20:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:20:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:20:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:20:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:20:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:20:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-12 01:20:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:20:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689615959] [2024-11-12 01:20:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689615959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:20:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811433173] [2024-11-12 01:20:08,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:20:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:20:08,875 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:20:08,877 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:20:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:09,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 01:20:09,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:20:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-12 01:20:09,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:20:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-12 01:20:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811433173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:20:09,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:20:09,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-12 01:20:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167761422] [2024-11-12 01:20:09,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:20:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:20:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:20:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:20:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:20:09,737 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-12 01:20:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:20:10,452 INFO L93 Difference]: Finished difference Result 222 states and 311 transitions. [2024-11-12 01:20:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 01:20:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 139 [2024-11-12 01:20:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:20:10,455 INFO L225 Difference]: With dead ends: 222 [2024-11-12 01:20:10,456 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 01:20:10,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=897, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 01:20:10,458 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 242 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:20:10,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 284 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 01:20:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 01:20:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2024-11-12 01:20:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:20:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-11-12 01:20:10,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2024-11-12 01:20:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:20:10,488 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-11-12 01:20:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-12 01:20:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-11-12 01:20:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:10,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:10,490 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:10,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:20:10,690 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:20:10,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:10,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2075900433, now seen corresponding path program 1 times [2024-11-12 01:20:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:20:10,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879788560] [2024-11-12 01:20:10,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:20:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:20:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175675985] [2024-11-12 01:20:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:10,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:20:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:20:10,743 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:20:10,744 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:20:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:20:10,865 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:20:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:20:10,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:20:10,943 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:20:10,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:20:10,959 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:20:11,145 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:20:11,148 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 01:20:11,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:20:11,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:20:11 BoogieIcfgContainer [2024-11-12 01:20:11,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:20:11,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:20:11,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:20:11,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:20:11,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:07" (3/4) ... [2024-11-12 01:20:11,227 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:20:11,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:20:11,229 INFO L158 Benchmark]: Toolchain (without parser) took 4698.57ms. Allocated memory was 134.2MB in the beginning and 224.4MB in the end (delta: 90.2MB). Free memory was 62.8MB in the beginning and 117.2MB in the end (delta: -54.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,230 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:20:11,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.80ms. Allocated memory is still 134.2MB. Free memory was 62.5MB in the beginning and 46.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.86ms. Allocated memory is still 134.2MB. Free memory was 46.6MB in the beginning and 43.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,232 INFO L158 Benchmark]: Boogie Preprocessor took 71.57ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 43.3MB in the beginning and 152.6MB in the end (delta: -109.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,232 INFO L158 Benchmark]: RCFGBuilder took 419.78ms. Allocated memory is still 186.6MB. Free memory was 151.7MB in the beginning and 131.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,232 INFO L158 Benchmark]: TraceAbstraction took 3866.40ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 130.8MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-11-12 01:20:11,235 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 224.4MB. Free memory was 118.2MB in the beginning and 117.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:20:11,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.80ms. Allocated memory is still 134.2MB. Free memory was 62.5MB in the beginning and 46.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.86ms. Allocated memory is still 134.2MB. Free memory was 46.6MB in the beginning and 43.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.57ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 43.3MB in the beginning and 152.6MB in the end (delta: -109.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 419.78ms. Allocated memory is still 186.6MB. Free memory was 151.7MB in the beginning and 131.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3866.40ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 130.8MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 224.4MB. Free memory was 118.2MB in the beginning and 117.2MB 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 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned short int var_1_2 = 2; [L24] unsigned short int var_1_3 = 8; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 0.6; [L29] unsigned long int var_1_8 = 32; [L30] unsigned long int var_1_9 = 32; [L31] float var_1_10 = 49.359; [L32] float var_1_11 = 5.5; [L33] unsigned long int var_1_12 = 128; [L34] unsigned char var_1_13 = 16; [L35] unsigned char var_1_14 = 0; [L36] unsigned long int var_1_15 = 8; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] double var_1_18 = 1.8; [L40] double var_1_19 = 4.5; [L41] double var_1_20 = 15.5; VAL [isInitial=0, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_2=2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L81] var_1_2 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L82] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] var_1_3 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L90] var_1_6 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L91] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L93] var_1_8 = __VERIFIER_nondet_ulong() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L96] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L97] var_1_9 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L98] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L99] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L99] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L100] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L100] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L101] var_1_10 = __VERIFIER_nondet_float() [L102] 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, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L102] 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, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L103] var_1_11 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L104] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L108] var_1_17 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L110] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L110] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L111] var_1_19 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L112] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L113] var_1_20 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L114] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L127] RET updateVariables() [L128] CALL step() [L45] COND FALSE !(var_1_2 < ((- var_1_3) * 64)) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L56] COND TRUE var_1_2 <= (var_1_3 + var_1_1) [L57] var_1_5 = ((var_1_3 == var_1_2) && var_1_6) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L61] COND FALSE !((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) [L66] var_1_7 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L68] COND TRUE var_1_7 <= (- (32.8f + var_1_10)) [L69] var_1_12 = var_1_3 VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L71] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L72] COND FALSE !(\read(var_1_4)) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L75] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L76] COND FALSE !(var_1_5 || var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L128] RET step() [L129] CALL, EXPR property() [L119-L120] return ((((((((var_1_2 < ((- var_1_3) * 64)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : ((-10000000 < var_1_2) ? (var_1_1 == ((unsigned long int) (((((((var_1_3) > (5u)) ? (var_1_3) : (5u))) < 0 ) ? -((((var_1_3) > (5u)) ? (var_1_3) : (5u))) : ((((var_1_3) > (5u)) ? (var_1_3) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((var_1_2 <= (var_1_3 + var_1_1)) ? (var_1_5 == ((unsigned char) ((var_1_3 == var_1_2) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_10) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_10))) ? (var_1_12 == ((unsigned long int) var_1_3)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_4 ? (var_1_15 == ((unsigned long int) ((((var_1_3) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_3) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 170 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 65 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 5 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3558/3696 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:20:11,259 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_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:20:13,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:20:13,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:20:13,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:20:13,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:20:13,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:20:13,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:20:13,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:20:13,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:20:13,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:20:13,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:20:13,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:20:13,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:20:13,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:20:13,159 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:20:13,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:20:13,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:20:13,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:20:13,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:20:13,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:20:13,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:20:13,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:20:13,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:20:13,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:20:13,163 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:20:13,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:20:13,163 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:20:13,164 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:20:13,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:20:13,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:20:13,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:20:13,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:20:13,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:20:13,167 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:20:13,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:20:13,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:20:13,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:20:13,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:20:13,168 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2024-11-12 01:20:13,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:20:13,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:20:13,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:20:13,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:20:13,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:20:13,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-12 01:20:14,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:20:14,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:20:14,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-12 01:20:14,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b73733/10a85f80def244f18a8a6edebfe88eec/FLAG25e88a6c8 [2024-11-12 01:20:14,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b73733/10a85f80def244f18a8a6edebfe88eec [2024-11-12 01:20:14,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:20:14,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:20:14,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:20:14,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:20:14,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:20:14,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:14" (1/1) ... [2024-11-12 01:20:14,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac2d204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:14, skipping insertion in model container [2024-11-12 01:20:14,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:14" (1/1) ... [2024-11-12 01:20:14,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:20:15,075 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_normal_file-85.i[913,926] [2024-11-12 01:20:15,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:20:15,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:20:15,157 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_normal_file-85.i[913,926] [2024-11-12 01:20:15,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:20:15,200 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:20:15,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15 WrapperNode [2024-11-12 01:20:15,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:20:15,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:20:15,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:20:15,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:20:15,207 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:20:15" (1/1) ... [2024-11-12 01:20:15,224 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:20:15" (1/1) ... [2024-11-12 01:20:15,243 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-12 01:20:15,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:20:15,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:20:15,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:20:15,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:20:15,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,273 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:20:15,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:20:15,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:20:15,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:20:15,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:20:15,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (1/1) ... [2024-11-12 01:20:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:20:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:20:15,325 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:20:15,326 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:20:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:20:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:20:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:20:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:20:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:20:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:20:15,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:20:15,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:20:17,199 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:20:17,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:20:17,208 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:20:17,209 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:20:17,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:17 BoogieIcfgContainer [2024-11-12 01:20:17,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:20:17,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:20:17,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:20:17,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:20:17,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:20:14" (1/3) ... [2024-11-12 01:20:17,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec0a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:17, skipping insertion in model container [2024-11-12 01:20:17,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:15" (2/3) ... [2024-11-12 01:20:17,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec0a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:17, skipping insertion in model container [2024-11-12 01:20:17,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:17" (3/3) ... [2024-11-12 01:20:17,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2024-11-12 01:20:17,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:20:17,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:20:17,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:20:17,284 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;@3860407b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:20:17,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:20:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 01:20:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:17,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:17,300 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1085262619, now seen corresponding path program 1 times [2024-11-12 01:20:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:20:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326893253] [2024-11-12 01:20:17,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:17,320 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:20:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:20:17,323 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:20:17,324 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:20:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:17,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:20:17,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:20:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-12 01:20:17,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:20:17,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:20:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326893253] [2024-11-12 01:20:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326893253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:20:17,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:20:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:20:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103843022] [2024-11-12 01:20:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:20:17,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:20:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:20:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:20:17,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:20:17,778 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 01:20:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:20:17,808 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-12 01:20:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:20:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 01:20:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:20:17,817 INFO L225 Difference]: With dead ends: 119 [2024-11-12 01:20:17,818 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 01:20:17,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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:20:17,825 INFO L435 NwaCegarLoop]: 85 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, 85 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:20:17,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:20:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 01:20:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 01:20:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 01:20:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-12 01:20:17,867 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-12 01:20:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:20:17,867 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-12 01:20:17,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 01:20:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-12 01:20:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:17,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:17,872 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 01:20:18,072 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:20:18,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:18,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2074053391, now seen corresponding path program 1 times [2024-11-12 01:20:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:20:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206880010] [2024-11-12 01:20:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:18,078 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:20:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:20:18,081 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:20:18,083 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:20:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:18,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 01:20:18,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:20:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-12 01:20:19,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:20:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-12 01:20:19,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:20:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206880010] [2024-11-12 01:20:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206880010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:20:19,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:20:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-12 01:20:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89745945] [2024-11-12 01:20:19,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:20:19,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 01:20:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:20:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 01:20:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:20:19,744 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-12 01:20:21,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:20:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:20:22,345 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2024-11-12 01:20:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 01:20:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 139 [2024-11-12 01:20:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:20:22,348 INFO L225 Difference]: With dead ends: 168 [2024-11-12 01:20:22,348 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 01:20:22,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2024-11-12 01:20:22,352 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 136 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:20:22,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 240 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 01:20:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 01:20:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-12 01:20:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:20:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-11-12 01:20:22,374 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2024-11-12 01:20:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:20:22,375 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-11-12 01:20:22,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-12 01:20:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-11-12 01:20:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 01:20:22,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:20:22,380 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:20:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:20:22,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:20:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:20:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2075900433, now seen corresponding path program 1 times [2024-11-12 01:20:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:20:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378966080] [2024-11-12 01:20:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:20:22,582 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:20:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:20:22,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:20:22,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:20:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:20:22,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 01:20:22,921 INFO L279 TraceCheckSpWp]: Computing forward predicates...