./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_steplocals_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:46:56,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:46:56,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:46:56,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:46:56,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:46:56,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:46:56,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:46:56,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:46:56,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:46:56,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:46:56,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:46:56,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:46:56,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:46:56,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:46:56,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:46:56,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:46:56,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:46:56,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:46:56,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:46:56,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:46:56,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:46:56,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:46:56,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:46:56,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:46:56,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:46:56,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:46:56,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:46:56,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:46:56,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:46:56,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:46:56,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:46:56,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:46:56,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:56,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:46:56,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:46:56,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:46:56,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:46:56,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:46:56,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:46:56,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:46:56,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:46:56,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:46:56,447 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-08 19:46:56,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:46:56,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:46:56,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:46:56,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:46:56,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:46:56,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-08 19:46:58,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:46:59,153 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:46:59,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-08 19:46:59,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718f79fde/d3b82534054047edb8480b7c4f9169c5/FLAG513f1dfce [2024-11-08 19:46:59,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718f79fde/d3b82534054047edb8480b7c4f9169c5 [2024-11-08 19:46:59,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:46:59,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:46:59,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:59,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:46:59,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:46:59,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65870940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59, skipping insertion in model container [2024-11-08 19:46:59,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:46:59,416 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_steplocals_file-47.i[917,930] [2024-11-08 19:46:59,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:59,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:46:59,505 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_steplocals_file-47.i[917,930] [2024-11-08 19:46:59,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:59,558 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:46:59,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59 WrapperNode [2024-11-08 19:46:59,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:59,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:59,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:46:59,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:46:59,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,673 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-08 19:46:59,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:59,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:46:59,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:46:59,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:46:59,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,739 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-08 19:46:59,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:46:59,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:46:59,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:46:59,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:46:59,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (1/1) ... [2024-11-08 19:46:59,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:46:59,828 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-08 19:46:59,835 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-08 19:46:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:46:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:46:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:46:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:46:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:46:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:46:59,993 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:46:59,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:47:00,468 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 19:47:00,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:47:00,488 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:47:00,490 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:47:00,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:47:00 BoogieIcfgContainer [2024-11-08 19:47:00,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:47:00,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:47:00,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:47:00,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:47:00,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:46:59" (1/3) ... [2024-11-08 19:47:00,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d15eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:47:00, skipping insertion in model container [2024-11-08 19:47:00,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:59" (2/3) ... [2024-11-08 19:47:00,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d15eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:47:00, skipping insertion in model container [2024-11-08 19:47:00,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:47:00" (3/3) ... [2024-11-08 19:47:00,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-08 19:47:00,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:47:00,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:47:00,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:47:00,597 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;@3c9d70c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:47:00,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:47:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:47:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:47:00,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:00,623 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:00,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1028946964, now seen corresponding path program 1 times [2024-11-08 19:47:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049835330] [2024-11-08 19:47:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:47:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:47:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:47:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:47:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:47:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:47:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:47:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:47:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:47:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:47:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:47:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:47:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:47:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:47:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:47:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:47:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:47:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:47:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:47:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:47:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:47:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:47:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:47:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:47:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:47:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:47:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:47:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049835330] [2024-11-08 19:47:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049835330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:47:01,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:47:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:47:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954997089] [2024-11-08 19:47:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:47:01,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:47:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:47:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:47:01,220 INFO L87 Difference]: Start difference. First operand has 97 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:01,257 INFO L93 Difference]: Finished difference Result 187 states and 322 transitions. [2024-11-08 19:47:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:47:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-08 19:47:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:01,268 INFO L225 Difference]: With dead ends: 187 [2024-11-08 19:47:01,268 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 19:47:01,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-08 19:47:01,276 INFO L432 NwaCegarLoop]: 140 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, 140 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-08 19:47:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:47:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 19:47:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 19:47:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:47:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2024-11-08 19:47:01,336 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 168 [2024-11-08 19:47:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2024-11-08 19:47:01,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2024-11-08 19:47:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 19:47:01,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:01,342 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:01,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:47:01,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 461797976, now seen corresponding path program 1 times [2024-11-08 19:47:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:01,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096838403] [2024-11-08 19:47:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:47:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:47:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:47:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:47:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:47:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:47:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:47:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:47:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:47:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:47:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:47:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:47:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:47:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:47:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:47:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:47:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:47:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:47:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:47:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:47:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:47:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:47:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:47:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:47:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:47:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:47:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 19:47:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096838403] [2024-11-08 19:47:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096838403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:47:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942089653] [2024-11-08 19:47:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:02,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:47:02,480 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-08 19:47:02,483 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-08 19:47:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:02,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:47:02,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 19:47:02,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:47:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 19:47:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942089653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:47:03,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:47:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 19:47:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671957450] [2024-11-08 19:47:03,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:47:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:47:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:47:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:47:03,148 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:47:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:04,343 INFO L93 Difference]: Finished difference Result 414 states and 617 transitions. [2024-11-08 19:47:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:47:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 169 [2024-11-08 19:47:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:04,349 INFO L225 Difference]: With dead ends: 414 [2024-11-08 19:47:04,349 INFO L226 Difference]: Without dead ends: 324 [2024-11-08 19:47:04,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:47:04,353 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 503 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:04,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 916 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 19:47:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-08 19:47:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 217. [2024-11-08 19:47:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 142 states have internal predecessors, (179), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 19:47:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2024-11-08 19:47:04,408 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 169 [2024-11-08 19:47:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:04,409 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2024-11-08 19:47:04,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:47:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2024-11-08 19:47:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 19:47:04,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:04,412 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:04,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:47:04,616 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-08 19:47:04,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:04,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -818065702, now seen corresponding path program 1 times [2024-11-08 19:47:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108287983] [2024-11-08 19:47:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:47:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:47:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:47:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:47:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:47:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:47:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:47:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:47:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:47:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:47:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:47:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:47:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:47:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:47:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:47:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:47:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:47:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:47:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:47:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:47:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:47:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:47:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:47:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:47:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:47:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:47:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 114 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-08 19:47:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108287983] [2024-11-08 19:47:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108287983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:47:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066527540] [2024-11-08 19:47:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:47:05,842 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-08 19:47:05,843 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-08 19:47:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:06,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 19:47:06,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-08 19:47:07,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:47:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066527540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:47:08,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:47:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2024-11-08 19:47:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750693561] [2024-11-08 19:47:08,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:47:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:47:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:47:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:47:08,009 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-08 19:47:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:11,373 INFO L93 Difference]: Finished difference Result 1169 states and 1622 transitions. [2024-11-08 19:47:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-08 19:47:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) Word has length 169 [2024-11-08 19:47:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:11,387 INFO L225 Difference]: With dead ends: 1169 [2024-11-08 19:47:11,388 INFO L226 Difference]: Without dead ends: 988 [2024-11-08 19:47:11,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=859, Invalid=4253, Unknown=0, NotChecked=0, Total=5112 [2024-11-08 19:47:11,395 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 806 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:11,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1205 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 19:47:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-08 19:47:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 439. [2024-11-08 19:47:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 309 states have (on average 1.2459546925566343) internal successors, (385), 312 states have internal predecessors, (385), 107 states have call successors, (107), 22 states have call predecessors, (107), 22 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-08 19:47:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 599 transitions. [2024-11-08 19:47:11,488 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 599 transitions. Word has length 169 [2024-11-08 19:47:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:11,489 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 599 transitions. [2024-11-08 19:47:11,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 20 states have internal predecessors, (91), 7 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-08 19:47:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 599 transitions. [2024-11-08 19:47:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 19:47:11,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:11,492 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:11,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:47:11,696 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-08 19:47:11,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:11,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2033180088, now seen corresponding path program 1 times [2024-11-08 19:47:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026976931] [2024-11-08 19:47:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:47:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:47:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:47:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:47:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:47:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:47:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:47:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:47:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:47:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:47:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:47:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:47:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:47:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:47:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:47:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:47:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:47:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:47:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:47:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:47:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:47:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:47:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:47:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:47:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:47:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:47:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:47:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026976931] [2024-11-08 19:47:11,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026976931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:47:11,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:47:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:47:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261486601] [2024-11-08 19:47:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:47:11,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:47:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:47:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:47:11,845 INFO L87 Difference]: Start difference. First operand 439 states and 599 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:47:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:11,949 INFO L93 Difference]: Finished difference Result 1129 states and 1525 transitions. [2024-11-08 19:47:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:47:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 19:47:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:11,958 INFO L225 Difference]: With dead ends: 1129 [2024-11-08 19:47:11,960 INFO L226 Difference]: Without dead ends: 738 [2024-11-08 19:47:11,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:47:11,963 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:11,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 354 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:47:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-08 19:47:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 733. [2024-11-08 19:47:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 539 states have (on average 1.2448979591836735) internal successors, (671), 546 states have internal predecessors, (671), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 19:47:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 981 transitions. [2024-11-08 19:47:12,050 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 981 transitions. Word has length 170 [2024-11-08 19:47:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:12,052 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 981 transitions. [2024-11-08 19:47:12,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:47:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 981 transitions. [2024-11-08 19:47:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 19:47:12,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:12,057 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:12,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:47:12,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:12,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1007410628, now seen corresponding path program 1 times [2024-11-08 19:47:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075895864] [2024-11-08 19:47:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:47:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:47:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:47:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:47:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:47:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:47:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:47:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:47:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:47:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:47:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:47:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:47:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:47:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:47:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:47:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:47:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:47:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:47:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:47:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:47:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:47:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:47:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:47:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:47:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:47:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:47:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:47:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075895864] [2024-11-08 19:47:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075895864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:47:12,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:47:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:47:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696847080] [2024-11-08 19:47:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:47:12,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:47:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:47:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:47:12,176 INFO L87 Difference]: Start difference. First operand 733 states and 981 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:47:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:12,292 INFO L93 Difference]: Finished difference Result 1878 states and 2510 transitions. [2024-11-08 19:47:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:47:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 19:47:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:12,301 INFO L225 Difference]: With dead ends: 1878 [2024-11-08 19:47:12,302 INFO L226 Difference]: Without dead ends: 1193 [2024-11-08 19:47:12,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:47:12,305 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:12,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 355 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:47:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-08 19:47:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 733. [2024-11-08 19:47:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 539 states have (on average 1.2374768089053803) internal successors, (667), 546 states have internal predecessors, (667), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 19:47:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 977 transitions. [2024-11-08 19:47:12,441 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 977 transitions. Word has length 170 [2024-11-08 19:47:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:12,444 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 977 transitions. [2024-11-08 19:47:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:47:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 977 transitions. [2024-11-08 19:47:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 19:47:12,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:12,447 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:47:12,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -306346050, now seen corresponding path program 1 times [2024-11-08 19:47:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201086138] [2024-11-08 19:47:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:47:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947445736] [2024-11-08 19:47:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:12,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:47:12,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:47:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:47:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:12,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:47:12,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 295 proven. 66 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2024-11-08 19:47:13,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:47:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:47:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201086138] [2024-11-08 19:47:13,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 19:47:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947445736] [2024-11-08 19:47:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947445736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:47:13,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:47:13,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-08 19:47:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831313331] [2024-11-08 19:47:13,298 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 19:47:13,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:47:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:47:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:47:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:47:13,300 INFO L87 Difference]: Start difference. First operand 733 states and 977 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:13,685 INFO L93 Difference]: Finished difference Result 1462 states and 1945 transitions. [2024-11-08 19:47:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:47:13,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-08 19:47:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:13,691 INFO L225 Difference]: With dead ends: 1462 [2024-11-08 19:47:13,691 INFO L226 Difference]: Without dead ends: 777 [2024-11-08 19:47:13,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:47:13,694 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 65 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:13,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 420 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:47:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-08 19:47:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 745. [2024-11-08 19:47:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 551 states have (on average 1.2431941923774954) internal successors, (685), 558 states have internal predecessors, (685), 155 states have call successors, (155), 38 states have call predecessors, (155), 38 states have return successors, (155), 148 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 19:47:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 995 transitions. [2024-11-08 19:47:13,772 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 995 transitions. Word has length 170 [2024-11-08 19:47:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:13,773 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 995 transitions. [2024-11-08 19:47:13,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 995 transitions. [2024-11-08 19:47:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 19:47:13,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:13,775 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:13,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:47:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:13,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1468661312, now seen corresponding path program 1 times [2024-11-08 19:47:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:47:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563503252] [2024-11-08 19:47:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:47:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703448715] [2024-11-08 19:47:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:47:14,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:47:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:47:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:47:14,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:47:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:47:14,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:47:14,358 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:47:14,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:47:14,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 19:47:14,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:47:14,565 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:47:14,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:47:14,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:47:14 BoogieIcfgContainer [2024-11-08 19:47:14,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:47:14,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:47:14,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:47:14,686 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:47:14,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:47:00" (3/4) ... [2024-11-08 19:47:14,689 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:47:14,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:47:14,690 INFO L158 Benchmark]: Toolchain (without parser) took 15504.78ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 124.8MB in the beginning and 193.8MB in the end (delta: -69.0MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,691 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:47:14,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.38ms. Allocated memory is still 199.2MB. Free memory was 124.6MB in the beginning and 107.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.13ms. Allocated memory is still 199.2MB. Free memory was 107.9MB in the beginning and 169.5MB in the end (delta: -61.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,691 INFO L158 Benchmark]: Boogie Preprocessor took 114.29ms. Allocated memory is still 199.2MB. Free memory was 169.5MB in the beginning and 162.6MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,692 INFO L158 Benchmark]: RCFGBuilder took 701.28ms. Allocated memory is still 199.2MB. Free memory was 162.6MB in the beginning and 133.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,692 INFO L158 Benchmark]: TraceAbstraction took 14192.43ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 133.2MB in the beginning and 193.8MB in the end (delta: -60.5MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-11-08 19:47:14,692 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 346.0MB. Free memory is still 193.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:47:14,694 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.15ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.38ms. Allocated memory is still 199.2MB. Free memory was 124.6MB in the beginning and 107.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.13ms. Allocated memory is still 199.2MB. Free memory was 107.9MB in the beginning and 169.5MB in the end (delta: -61.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.29ms. Allocated memory is still 199.2MB. Free memory was 169.5MB in the beginning and 162.6MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 701.28ms. Allocated memory is still 199.2MB. Free memory was 162.6MB in the beginning and 133.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14192.43ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 133.2MB in the beginning and 193.8MB in the end (delta: -60.5MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 346.0MB. Free memory is still 193.8MB. 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 someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_2 = 50.5; [L24] double var_1_3 = 0.875; [L25] unsigned short int var_1_4 = 49926; [L26] unsigned short int var_1_5 = 500; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 2; [L29] unsigned char var_1_8 = 64; [L30] unsigned short int var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 10; [L33] float var_1_12 = 0.19999999999999996; [L34] float var_1_13 = 9.2; [L35] float var_1_14 = 5.8; [L36] float var_1_15 = 31.25; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L41] unsigned short int var_1_20 = 256; [L42] unsigned short int var_1_21 = 23544; [L43] unsigned long int var_1_22 = 64; VAL [isInitial=0, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_2=101/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L96] var_1_4 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L99] var_1_5 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L101] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_7=2, var_1_8=64, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L104] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=2, var_1_8=64, var_1_9=5] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_8=64, var_1_9=5] [L107] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L107] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=5] [L108] var_1_9 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L110] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L113] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L113] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L116] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L116] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L118] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L119] var_1_14 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L120] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L121] var_1_15 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L123] var_1_17 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L124] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L125] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L125] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L128] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L128] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L130] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE var_1_2 >= (1.3 / var_1_3) [L48] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L52] signed long int stepLocal_0 = 32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))); VAL [isInitial=1, stepLocal_0=16384, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L53] COND FALSE !(var_1_5 >= stepLocal_0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L58] COND FALSE !(\read(var_1_10)) [L63] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L65] COND FALSE !((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) [L68] var_1_16 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L70] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L71] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L76] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=49150, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L77] COND TRUE var_1_6 <= stepLocal_2 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L78] COND FALSE !(\read(var_1_16)) [L81] var_1_20 = 16 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] EXPR 2 ^ var_1_1 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] EXPR (((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1)) VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L86] COND FALSE !(var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L136-L137] return (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=49150, var_1_5=-114689, var_1_6=163839, var_1_7=49151, var_1_8=64, var_1_9=-49124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1638 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1593 mSDsluCounter, 3390 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2286 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3135 IncrementalHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 1104 mSDtfsCounter, 3135 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 1097 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=745occurred in iteration=6, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1153 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1864 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1514 ConstructedInterpolants, 1 QuantifiedInterpolants, 4692 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1109 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 11361/11700 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-08 19:47:14,742 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_steplocals_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:47:16,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:47:17,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:47:17,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:47:17,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:47:17,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:47:17,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:47:17,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:47:17,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:47:17,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:47:17,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:47:17,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:47:17,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:47:17,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:47:17,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:47:17,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:47:17,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:47:17,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:47:17,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:47:17,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:47:17,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:47:17,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:47:17,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:47:17,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:47:17,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:47:17,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:47:17,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:47:17,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:47:17,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:47:17,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:47:17,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:47:17,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:47:17,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:47:17,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:47:17,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:47:17,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:47:17,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:47:17,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:47:17,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:47:17,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:47:17,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:47:17,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:47:17,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:47:17,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:47:17,128 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 -> 874b8c0685149675525220fee2d5689c1d5289515348c6c05c19ae6cc8a7fb40 [2024-11-08 19:47:17,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:47:17,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:47:17,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:47:17,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:47:17,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:47:17,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-08 19:47:18,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:47:19,235 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:47:19,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-47.i [2024-11-08 19:47:19,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae4e1bef/1cb6599871634ee39131293c8d9846ea/FLAG5fdb5149a [2024-11-08 19:47:19,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae4e1bef/1cb6599871634ee39131293c8d9846ea [2024-11-08 19:47:19,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:47:19,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:47:19,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:47:19,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:47:19,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:47:19,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd12564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19, skipping insertion in model container [2024-11-08 19:47:19,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:47:19,526 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_steplocals_file-47.i[917,930] [2024-11-08 19:47:19,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:47:19,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:47:19,643 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_steplocals_file-47.i[917,930] [2024-11-08 19:47:19,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:47:19,707 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:47:19,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19 WrapperNode [2024-11-08 19:47:19,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:47:19,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:47:19,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:47:19,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:47:19,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,771 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-08 19:47:19,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:47:19,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:47:19,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:47:19,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:47:19,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,817 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-08 19:47:19,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:47:19,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:47:19,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:47:19,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:47:19,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (1/1) ... [2024-11-08 19:47:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:47:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:47:19,901 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-08 19:47:19,905 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-08 19:47:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:47:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:47:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:47:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:47:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:47:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:47:20,052 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:47:20,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:47:29,291 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:47:29,291 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:47:29,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:47:29,308 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:47:29,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:47:29 BoogieIcfgContainer [2024-11-08 19:47:29,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:47:29,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:47:29,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:47:29,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:47:29,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:47:19" (1/3) ... [2024-11-08 19:47:29,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d23b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:47:29, skipping insertion in model container [2024-11-08 19:47:29,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:47:19" (2/3) ... [2024-11-08 19:47:29,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d23b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:47:29, skipping insertion in model container [2024-11-08 19:47:29,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:47:29" (3/3) ... [2024-11-08 19:47:29,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-47.i [2024-11-08 19:47:29,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:47:29,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:47:29,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:47:29,407 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;@71f4ff0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:47:29,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:47:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:47:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:47:29,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:29,424 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:29,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1746493275, now seen corresponding path program 1 times [2024-11-08 19:47:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:47:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082194293] [2024-11-08 19:47:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:29,444 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-08 19:47:29,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:47:29,447 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-08 19:47:29,449 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-08 19:47:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:30,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:47:30,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-08 19:47:30,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:47:30,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:47:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082194293] [2024-11-08 19:47:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082194293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:47:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:47:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:47:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024833989] [2024-11-08 19:47:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:47:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:47:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:47:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:47:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:47:30,678 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:30,715 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-08 19:47:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:47:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-08 19:47:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:30,726 INFO L225 Difference]: With dead ends: 141 [2024-11-08 19:47:30,726 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:47:30,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-08 19:47:30,734 INFO L432 NwaCegarLoop]: 106 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, 106 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-08 19:47:30,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:47:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:47:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 19:47:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:47:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-08 19:47:30,775 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 164 [2024-11-08 19:47:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:30,775 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-08 19:47:30,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:47:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-08 19:47:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:47:30,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:30,779 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:30,803 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-08 19:47:30,983 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-08 19:47:30,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1101803117, now seen corresponding path program 1 times [2024-11-08 19:47:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:47:30,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132172450] [2024-11-08 19:47:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:30,986 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-08 19:47:30,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:47:30,988 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-08 19:47:30,989 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-08 19:47:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:31,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:47:31,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 19:47:33,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:47:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 19:47:35,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:47:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132172450] [2024-11-08 19:47:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132172450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:47:35,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:47:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 19:47:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965134851] [2024-11-08 19:47:35,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:47:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:47:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:47:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:47:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:47:35,115 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:47:41,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:47:45,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:47:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:47:51,269 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2024-11-08 19:47:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:47:51,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 164 [2024-11-08 19:47:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:47:51,273 INFO L225 Difference]: With dead ends: 322 [2024-11-08 19:47:51,274 INFO L226 Difference]: Without dead ends: 255 [2024-11-08 19:47:51,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:47:51,276 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 144 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:47:51,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 501 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 14.5s Time] [2024-11-08 19:47:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-08 19:47:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 171. [2024-11-08 19:47:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 96 states have internal predecessors, (111), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 19:47:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2024-11-08 19:47:51,339 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 164 [2024-11-08 19:47:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:47:51,340 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2024-11-08 19:47:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:47:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2024-11-08 19:47:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:47:51,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:47:51,344 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:47:51,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:47:51,544 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-08 19:47:51,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:47:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:47:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 708776107, now seen corresponding path program 1 times [2024-11-08 19:47:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:47:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35967707] [2024-11-08 19:47:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:47:51,547 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-08 19:47:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:47:51,549 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-08 19:47:51,550 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-08 19:47:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:52,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:47:52,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:47:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-08 19:47:57,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:48:00,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:48:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35967707] [2024-11-08 19:48:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35967707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:48:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063690841] [2024-11-08 19:48:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:00,069 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 19:48:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 19:48:00,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 19:48:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 19:48:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:02,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:48:02,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:48:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-08 19:48:06,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:48:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063690841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:48:08,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:48:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-08 19:48:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645932712] [2024-11-08 19:48:08,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:48:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:48:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:48:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:48:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:48:08,418 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 19:48:15,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []