./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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_operatoramount_amount50_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 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:09:33,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:09:34,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:09:34,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:09:34,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:09:34,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:09:34,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:09:34,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:09:34,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:09:34,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:09:34,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:09:34,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:09:34,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:09:34,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:09:34,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:09:34,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:09:34,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:09:34,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:09:34,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:09:34,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:09:34,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:09:34,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:09:34,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:09:34,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:09:34,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:09:34,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:09:34,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:09:34,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:09:34,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:09:34,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:09:34,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:09:34,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:09:34,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:09:34,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:09:34,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:09:34,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:09:34,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:09:34,053 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 -> 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 [2024-11-09 01:09:34,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:09:34,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:09:34,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:09:34,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:09:34,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:09:34,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-09 01:09:35,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:09:35,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:09:35,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-09 01:09:35,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655649961/bc9072023122420f91c9bc756af400ea/FLAG33278d3ba [2024-11-09 01:09:36,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655649961/bc9072023122420f91c9bc756af400ea [2024-11-09 01:09:36,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:09:36,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:09:36,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:09:36,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:09:36,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:09:36,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3912959e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36, skipping insertion in model container [2024-11-09 01:09:36,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:09:36,174 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_operatoramount_amount50_file-47.i[915,928] [2024-11-09 01:09:36,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:09:36,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:09:36,243 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_operatoramount_amount50_file-47.i[915,928] [2024-11-09 01:09:36,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:09:36,283 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:09:36,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36 WrapperNode [2024-11-09 01:09:36,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:09:36,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:09:36,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:09:36,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:09:36,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,349 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-09 01:09:36,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:09:36,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:09:36,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:09:36,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:09:36,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,408 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-09 01:09:36,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:09:36,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:09:36,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:09:36,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:09:36,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (1/1) ... [2024-11-09 01:09:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:09:36,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:36,468 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-09 01:09:36,471 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-09 01:09:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:09:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:09:36,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:09:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:09:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:09:36,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:09:36,581 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:09:36,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:09:36,911 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 01:09:36,911 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:09:36,921 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:09:36,921 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:09:36,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:09:36 BoogieIcfgContainer [2024-11-09 01:09:36,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:09:36,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:09:36,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:09:36,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:09:36,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:09:36" (1/3) ... [2024-11-09 01:09:36,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c82c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:09:36, skipping insertion in model container [2024-11-09 01:09:36,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:36" (2/3) ... [2024-11-09 01:09:36,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c82c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:09:36, skipping insertion in model container [2024-11-09 01:09:36,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:09:36" (3/3) ... [2024-11-09 01:09:36,929 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-47.i [2024-11-09 01:09:36,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:09:36,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:09:36,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:09:37,000 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;@5acde715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:09:37,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:09:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:09:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:09:37,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:37,016 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:37,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:37,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:37,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1126597033, now seen corresponding path program 1 times [2024-11-09 01:09:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737041279] [2024-11-09 01:09:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:09:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737041279] [2024-11-09 01:09:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737041279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:37,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:37,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:09:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850847849] [2024-11-09 01:09:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:37,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:09:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:37,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:09:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:09:37,347 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:37,395 INFO L93 Difference]: Finished difference Result 171 states and 291 transitions. [2024-11-09 01:09:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:09:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-09 01:09:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:37,402 INFO L225 Difference]: With dead ends: 171 [2024-11-09 01:09:37,402 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 01:09:37,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-09 01:09:37,407 INFO L432 NwaCegarLoop]: 127 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, 127 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-09 01:09:37,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:09:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 01:09:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 01:09:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:09:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-11-09 01:09:37,442 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 140 [2024-11-09 01:09:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-11-09 01:09:37,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-11-09 01:09:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:09:37,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:37,448 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:37,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:09:37,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1816447203, now seen corresponding path program 1 times [2024-11-09 01:09:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604789554] [2024-11-09 01:09:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:09:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604789554] [2024-11-09 01:09:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604789554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:09:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481287836] [2024-11-09 01:09:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:38,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:09:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:38,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:09:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:09:38,040 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:38,319 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2024-11-09 01:09:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:09:38,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-09 01:09:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:38,324 INFO L225 Difference]: With dead ends: 363 [2024-11-09 01:09:38,325 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 01:09:38,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:09:38,327 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 303 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:38,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 514 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:09:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 01:09:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 177. [2024-11-09 01:09:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:09:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2024-11-09 01:09:38,361 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 141 [2024-11-09 01:09:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:38,362 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2024-11-09 01:09:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2024-11-09 01:09:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:09:38,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:38,364 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:09:38,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 789576351, now seen corresponding path program 1 times [2024-11-09 01:09:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039991981] [2024-11-09 01:09:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:09:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039991981] [2024-11-09 01:09:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039991981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:38,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:09:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642647609] [2024-11-09 01:09:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:09:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:09:38,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:09:38,868 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:39,041 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2024-11-09 01:09:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:09:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-09 01:09:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:39,046 INFO L225 Difference]: With dead ends: 342 [2024-11-09 01:09:39,046 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 01:09:39,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:09:39,048 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:39,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:09:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 01:09:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2024-11-09 01:09:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:09:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-09 01:09:39,080 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 141 [2024-11-09 01:09:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:39,083 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-09 01:09:39,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-09 01:09:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:09:39,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:39,085 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:39,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:09:39,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:39,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1594952904, now seen corresponding path program 1 times [2024-11-09 01:09:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834120352] [2024-11-09 01:09:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:09:39,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:39,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834120352] [2024-11-09 01:09:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834120352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:39,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:39,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:09:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474400103] [2024-11-09 01:09:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:09:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:09:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:09:39,660 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:40,071 INFO L93 Difference]: Finished difference Result 361 states and 534 transitions. [2024-11-09 01:09:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:09:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-09 01:09:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:40,074 INFO L225 Difference]: With dead ends: 361 [2024-11-09 01:09:40,076 INFO L226 Difference]: Without dead ends: 279 [2024-11-09 01:09:40,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:09:40,080 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 255 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:40,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 373 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:09:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-09 01:09:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2024-11-09 01:09:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 204 states have (on average 1.3186274509803921) internal successors, (269), 205 states have internal predecessors, (269), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 01:09:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 399 transitions. [2024-11-09 01:09:40,124 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 399 transitions. Word has length 143 [2024-11-09 01:09:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:40,124 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 399 transitions. [2024-11-09 01:09:40,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 399 transitions. [2024-11-09 01:09:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:09:40,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:40,130 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:09:40,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:40,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 872076683, now seen corresponding path program 1 times [2024-11-09 01:09:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16836942] [2024-11-09 01:09:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-09 01:09:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16836942] [2024-11-09 01:09:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16836942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443813777] [2024-11-09 01:09:40,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:40,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:40,956 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-09 01:09:40,957 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-09 01:09:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:41,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:09:41,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:09:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-09 01:09:42,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:09:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-09 01:09:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443813777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:09:43,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:09:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 34 [2024-11-09 01:09:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565143152] [2024-11-09 01:09:43,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:09:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 01:09:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 01:09:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 01:09:43,007 INFO L87 Difference]: Start difference. First operand 274 states and 399 transitions. Second operand has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) [2024-11-09 01:09:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:47,071 INFO L93 Difference]: Finished difference Result 881 states and 1226 transitions. [2024-11-09 01:09:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-09 01:09:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) Word has length 144 [2024-11-09 01:09:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:47,075 INFO L225 Difference]: With dead ends: 881 [2024-11-09 01:09:47,076 INFO L226 Difference]: Without dead ends: 669 [2024-11-09 01:09:47,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2753, Invalid=10357, Unknown=0, NotChecked=0, Total=13110 [2024-11-09 01:09:47,080 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1213 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:47,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1878 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:09:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-09 01:09:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 384. [2024-11-09 01:09:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.3125) internal successors, (399), 305 states have internal predecessors, (399), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 01:09:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 529 transitions. [2024-11-09 01:09:47,131 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 529 transitions. Word has length 144 [2024-11-09 01:09:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:47,131 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 529 transitions. [2024-11-09 01:09:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) [2024-11-09 01:09:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 529 transitions. [2024-11-09 01:09:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:09:47,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:47,133 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:47,148 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-09 01:09:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:47,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1663097356, now seen corresponding path program 1 times [2024-11-09 01:09:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211924149] [2024-11-09 01:09:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:09:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211924149] [2024-11-09 01:09:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211924149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:09:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047290876] [2024-11-09 01:09:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:47,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:09:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:09:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:09:47,491 INFO L87 Difference]: Start difference. First operand 384 states and 529 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:47,608 INFO L93 Difference]: Finished difference Result 776 states and 1073 transitions. [2024-11-09 01:09:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:09:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-09 01:09:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:47,612 INFO L225 Difference]: With dead ends: 776 [2024-11-09 01:09:47,612 INFO L226 Difference]: Without dead ends: 601 [2024-11-09 01:09:47,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:09:47,613 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 106 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:47,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 437 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:09:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-09 01:09:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 418. [2024-11-09 01:09:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 339 states have internal predecessors, (438), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 01:09:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 568 transitions. [2024-11-09 01:09:47,653 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 568 transitions. Word has length 144 [2024-11-09 01:09:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 568 transitions. [2024-11-09 01:09:47,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:09:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 568 transitions. [2024-11-09 01:09:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:09:47,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:47,655 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:47,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:09:47,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:47,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1260780451, now seen corresponding path program 1 times [2024-11-09 01:09:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:47,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470497095] [2024-11-09 01:09:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:09:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:09:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:09:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:09:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:09:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:09:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:09:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:09:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:09:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:09:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:09:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:09:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:09:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:09:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:09:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:09:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:09:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:09:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:09:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:09:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:09:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:09:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470497095] [2024-11-09 01:09:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470497095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515267763] [2024-11-09 01:09:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:47,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:47,969 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-09 01:09:47,970 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-09 01:09:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:48,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:09:48,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:09:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 188 proven. 102 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-09 01:09:48,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:09:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:09:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515267763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:09:49,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:09:49,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2024-11-09 01:09:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403507130] [2024-11-09 01:09:49,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:09:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:09:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:09:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:09:49,119 INFO L87 Difference]: Start difference. First operand 418 states and 568 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-09 01:09:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:49,727 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-11-09 01:09:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:09:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) Word has length 145 [2024-11-09 01:09:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:49,730 INFO L225 Difference]: With dead ends: 740 [2024-11-09 01:09:49,730 INFO L226 Difference]: Without dead ends: 396 [2024-11-09 01:09:49,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:09:49,731 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 307 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:49,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 911 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:09:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-09 01:09:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2024-11-09 01:09:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 305 states have (on average 1.278688524590164) internal successors, (390), 306 states have internal predecessors, (390), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 01:09:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2024-11-09 01:09:49,761 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 145 [2024-11-09 01:09:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:49,761 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2024-11-09 01:09:49,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-09 01:09:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2024-11-09 01:09:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:09:49,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:49,763 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:49,775 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-09 01:09:49,963 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,SelfDestructingSolverStorable6 [2024-11-09 01:09:49,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:49,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1267294736, now seen corresponding path program 1 times [2024-11-09 01:09:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:49,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215738477] [2024-11-09 01:09:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:09:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072224672] [2024-11-09 01:09:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:50,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:50,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:50,024 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-09 01:09:50,025 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-09 01:09:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:50,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:09:50,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:09:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-09 01:09:50,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:09:50,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:09:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215738477] [2024-11-09 01:09:50,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:09:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072224672] [2024-11-09 01:09:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072224672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:50,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:09:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-09 01:09:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261926255] [2024-11-09 01:09:50,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 01:09:50,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:09:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:09:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:09:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:09:50,805 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:51,032 INFO L93 Difference]: Finished difference Result 698 states and 949 transitions. [2024-11-09 01:09:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:09:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 146 [2024-11-09 01:09:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:51,034 INFO L225 Difference]: With dead ends: 698 [2024-11-09 01:09:51,034 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 01:09:51,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:09:51,036 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:51,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 578 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:09:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 01:09:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 387. [2024-11-09 01:09:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 307 states have (on average 1.276872964169381) internal successors, (392), 308 states have internal predecessors, (392), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 01:09:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 522 transitions. [2024-11-09 01:09:51,069 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 522 transitions. Word has length 146 [2024-11-09 01:09:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:51,070 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 522 transitions. [2024-11-09 01:09:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:09:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 522 transitions. [2024-11-09 01:09:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:09:51,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:51,071 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:09:51,084 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-09 01:09:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:51,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 507712626, now seen corresponding path program 1 times [2024-11-09 01:09:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:09:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441209895] [2024-11-09 01:09:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:09:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995376603] [2024-11-09 01:09:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:51,326 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-09 01:09:51,326 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-09 01:09:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:09:51,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:09:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:09:51,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:09:51,714 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:09:51,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:09:51,730 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-09 01:09:51,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:51,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:52,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:09:52,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:09:52 BoogieIcfgContainer [2024-11-09 01:09:52,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:09:52,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:09:52,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:09:52,011 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:09:52,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:09:36" (3/4) ... [2024-11-09 01:09:52,014 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:09:52,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:09:52,015 INFO L158 Benchmark]: Toolchain (without parser) took 16003.51ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 114.0MB in the beginning and 246.4MB in the end (delta: -132.5MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,016 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:09:52,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.14ms. Allocated memory is still 180.4MB. Free memory was 113.8MB in the beginning and 97.3MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.72ms. Allocated memory is still 180.4MB. Free memory was 97.3MB in the beginning and 151.3MB in the end (delta: -54.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,016 INFO L158 Benchmark]: Boogie Preprocessor took 88.70ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 144.8MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,016 INFO L158 Benchmark]: RCFGBuilder took 482.48ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 117.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,017 INFO L158 Benchmark]: TraceAbstraction took 15087.15ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 116.0MB in the beginning and 246.4MB in the end (delta: -130.4MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-11-09 01:09:52,017 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 408.9MB. Free memory is still 246.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:09:52,018 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.13ms. Allocated memory is still 104.9MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.14ms. Allocated memory is still 180.4MB. Free memory was 113.8MB in the beginning and 97.3MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.72ms. Allocated memory is still 180.4MB. Free memory was 97.3MB in the beginning and 151.3MB in the end (delta: -54.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.70ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 144.8MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 482.48ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 117.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15087.15ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 116.0MB in the beginning and 246.4MB in the end (delta: -130.4MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 408.9MB. Free memory is still 246.4MB. 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 133, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of bitwiseOr at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L93] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] 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, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-81922, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < 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)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= 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_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < 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)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= 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_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, 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=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2332 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2322 mSDsluCounter, 5159 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4013 mSDsCounter, 718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3950 IncrementalHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 718 mSolverCounterUnsat, 1146 mSDtfsCounter, 3950 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4415 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=6, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 625 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1871 NumberOfCodeBlocks, 1871 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1710 ConstructedInterpolants, 0 QuantifiedInterpolants, 11231 SizeOfPredicates, 13 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 9621/10080 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-09 01:09:52,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:09:53,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:09:53,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:09:53,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:09:53,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:09:53,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:09:53,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:09:53,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:09:53,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:09:53,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:09:53,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:09:53,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:09:53,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:09:53,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:09:53,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:09:53,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:09:53,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:09:53,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:09:53,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:09:53,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:09:53,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:09:53,901 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:09:53,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:09:53,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:09:53,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:09:53,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:09:53,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:09:53,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:09:53,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:09:53,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:09:53,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:09:53,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:09:53,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:09:53,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:09:53,906 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 -> 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 [2024-11-09 01:09:54,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:09:54,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:09:54,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:09:54,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:09:54,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:09:54,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-09 01:09:55,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:09:55,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:09:55,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-09 01:09:55,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04693a7f/fc17601bfa4246f2b4767bb8bf8afbc2/FLAG507214663 [2024-11-09 01:09:56,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04693a7f/fc17601bfa4246f2b4767bb8bf8afbc2 [2024-11-09 01:09:56,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:09:56,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:09:56,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:09:56,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:09:56,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:09:56,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3c0b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56, skipping insertion in model container [2024-11-09 01:09:56,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:09:56,177 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_operatoramount_amount50_file-47.i[915,928] [2024-11-09 01:09:56,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:09:56,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:09:56,270 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_operatoramount_amount50_file-47.i[915,928] [2024-11-09 01:09:56,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:09:56,326 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:09:56,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56 WrapperNode [2024-11-09 01:09:56,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:09:56,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:09:56,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:09:56,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:09:56,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,365 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-09 01:09:56,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:09:56,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:09:56,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:09:56,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:09:56,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,390 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-09 01:09:56,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:09:56,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:09:56,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:09:56,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:09:56,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (1/1) ... [2024-11-09 01:09:56,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:09:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:09:56,434 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-09 01:09:56,436 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-09 01:09:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:09:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:09:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:09:56,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:09:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:09:56,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:09:56,535 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:09:56,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:10:08,829 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 01:10:08,829 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:10:08,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:10:08,837 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:10:08,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:08 BoogieIcfgContainer [2024-11-09 01:10:08,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:10:08,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:10:08,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:10:08,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:10:08,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:09:56" (1/3) ... [2024-11-09 01:10:08,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6146f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:08, skipping insertion in model container [2024-11-09 01:10:08,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:09:56" (2/3) ... [2024-11-09 01:10:08,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6146f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:08, skipping insertion in model container [2024-11-09 01:10:08,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:08" (3/3) ... [2024-11-09 01:10:08,843 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-47.i [2024-11-09 01:10:08,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:10:08,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:10:08,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:10:08,903 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;@77ae2ffd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:10:08,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:10:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:10:08,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:08,917 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:08,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:08,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash 742321370, now seen corresponding path program 1 times [2024-11-09 01:10:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199431888] [2024-11-09 01:10:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:08,935 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-09 01:10:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:08,938 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-09 01:10:08,938 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-09 01:10:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:09,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:10:09,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-09 01:10:12,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:10:12,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199431888] [2024-11-09 01:10:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199431888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:10:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [975290181] [2024-11-09 01:10:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:10:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:10:12,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:10:12,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-09 01:10:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:13,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:10:13,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:16,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [975290181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:10:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-09 01:10:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931812902] [2024-11-09 01:10:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:16,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:10:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:10:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:10:16,551 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:21,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:25,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:27,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:32,645 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-09 01:10:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:32,736 INFO L93 Difference]: Finished difference Result 291 states and 542 transitions. [2024-11-09 01:10:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:10:32,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-09 01:10:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:32,746 INFO L225 Difference]: With dead ends: 291 [2024-11-09 01:10:32,746 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 01:10:32,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:10:32,751 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 133 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:32,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 472 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2024-11-09 01:10:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 01:10:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2024-11-09 01:10:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:10:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-09 01:10:32,808 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 136 [2024-11-09 01:10:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:32,809 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-09 01:10:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-09 01:10:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:10:32,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:32,814 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:32,835 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-09 01:10:33,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-09 01:10:33,218 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:10:33,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash -268795880, now seen corresponding path program 1 times [2024-11-09 01:10:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377254218] [2024-11-09 01:10:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:33,220 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-09 01:10:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:33,224 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-09 01:10:33,225 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-09 01:10:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:33,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:10:33,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:40,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:40,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377254218] [2024-11-09 01:10:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377254218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:40,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:10:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993889493] [2024-11-09 01:10:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:40,647 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:45,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:49,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:53,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:57,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:01,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:06,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:07,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:11:07,516 INFO L93 Difference]: Finished difference Result 253 states and 377 transitions. [2024-11-09 01:11:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:11:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-09 01:11:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:11:07,599 INFO L225 Difference]: With dead ends: 253 [2024-11-09 01:11:07,600 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 01:11:07,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:11:07,601 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:11:07,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 251 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 26.7s Time] [2024-11-09 01:11:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 01:11:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2024-11-09 01:11:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:11:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-11-09 01:11:07,617 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 136 [2024-11-09 01:11:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:11:07,619 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-11-09 01:11:07,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:11:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-11-09 01:11:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:11:07,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:11:07,622 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:11:07,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:11:07,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:11:07,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:11:07,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:11:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2123544737, now seen corresponding path program 1 times [2024-11-09 01:11:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:11:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236165025] [2024-11-09 01:11:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:11:07,826 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-09 01:11:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:11:07,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:11:07,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:11:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:08,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:11:08,474 INFO L278 TraceCheckSpWp]: Computing forward predicates...