./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:53:37,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:53:37,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 18:53:37,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:53:37,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:53:37,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:53:37,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:53:37,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:53:37,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:53:37,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:53:37,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:53:37,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:53:37,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:53:37,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:53:37,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:53:37,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:53:37,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:53:37,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:53:37,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 18:53:37,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:53:37,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:53:37,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:53:37,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:53:37,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:53:37,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:53:37,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:53:37,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:53:37,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:53:37,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:53:37,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:53:37,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:53:37,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:53:37,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:53:37,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:53:37,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:53:37,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:53:37,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 18:53:37,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 18:53:37,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:53:37,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:53:37,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:53:37,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:53:37,600 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2024-11-18 18:53:37,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:53:37,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:53:37,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:53:37,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:53:37,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:53:37,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-11-18 18:53:39,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:53:39,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:53:39,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-11-18 18:53:39,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009c14974/904919cb87324b58979c253ec9d5d9ee/FLAGb96a04014 [2024-11-18 18:53:39,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009c14974/904919cb87324b58979c253ec9d5d9ee [2024-11-18 18:53:39,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:53:39,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:53:39,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:53:39,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:53:39,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:53:39,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:53:39" (1/1) ... [2024-11-18 18:53:39,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f948ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:39, skipping insertion in model container [2024-11-18 18:53:39,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:53:39" (1/1) ... [2024-11-18 18:53:39,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:53:40,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i[917,930] [2024-11-18 18:53:40,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:53:40,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:53:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i[917,930] [2024-11-18 18:53:40,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:53:40,297 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:53:40,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40 WrapperNode [2024-11-18 18:53:40,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:53:40,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:53:40,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:53:40,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:53:40,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,387 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-18 18:53:40,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:53:40,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:53:40,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:53:40,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:53:40,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,432 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-18 18:53:40,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:53:40,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:53:40,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:53:40,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:53:40,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (1/1) ... [2024-11-18 18:53:40,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:53:40,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:53:40,501 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-18 18:53:40,508 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-18 18:53:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:53:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:53:40,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:53:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 18:53:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:53:40,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:53:40,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:53:40,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:53:41,204 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-18 18:53:41,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:53:41,219 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:53:41,220 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:53:41,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:41 BoogieIcfgContainer [2024-11-18 18:53:41,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:53:41,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:53:41,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:53:41,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:53:41,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:53:39" (1/3) ... [2024-11-18 18:53:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec28c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:53:41, skipping insertion in model container [2024-11-18 18:53:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:53:40" (2/3) ... [2024-11-18 18:53:41,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec28c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:53:41, skipping insertion in model container [2024-11-18 18:53:41,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:41" (3/3) ... [2024-11-18 18:53:41,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i [2024-11-18 18:53:41,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:53:41,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:53:41,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:53:41,323 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;@69ae9cea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:53:41,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:53:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-18 18:53:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-18 18:53:41,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:53:41,345 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:53:41,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:53:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:53:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -480624851, now seen corresponding path program 1 times [2024-11-18 18:53:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:53:41,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462430405] [2024-11-18 18:53:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:53:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:53:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:53:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-18 18:53:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:53:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462430405] [2024-11-18 18:53:41,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462430405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:53:41,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404745428] [2024-11-18 18:53:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:53:41,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:53:41,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:53:41,750 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-18 18:53:41,751 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-18 18:53:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:53:41,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:53:41,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:53:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-18 18:53:41,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:53:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404745428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:53:41,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:53:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 18:53:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28790095] [2024-11-18 18:53:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:53:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:53:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:53:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:53:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:53:42,077 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:53:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:53:42,116 INFO L93 Difference]: Finished difference Result 167 states and 286 transitions. [2024-11-18 18:53:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:53:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-11-18 18:53:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:53:42,127 INFO L225 Difference]: With dead ends: 167 [2024-11-18 18:53:42,127 INFO L226 Difference]: Without dead ends: 83 [2024-11-18 18:53:42,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-18 18:53:42,135 INFO L432 NwaCegarLoop]: 126 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, 126 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-18 18:53:42,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:53:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-18 18:53:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-18 18:53:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-18 18:53:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-11-18 18:53:42,181 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 167 [2024-11-18 18:53:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:53:42,181 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-11-18 18:53:42,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:53:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-11-18 18:53:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-18 18:53:42,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:53:42,186 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:53:42,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 18:53:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 18:53:42,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:53:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:53:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1430748969, now seen corresponding path program 1 times [2024-11-18 18:53:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:53:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575891524] [2024-11-18 18:53:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:53:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:53:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:53:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:53:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:53:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575891524] [2024-11-18 18:53:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575891524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:53:49,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:53:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 18:53:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253118505] [2024-11-18 18:53:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:53:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:53:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:53:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:53:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 18:53:49,785 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:53:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:53:51,098 INFO L93 Difference]: Finished difference Result 199 states and 300 transitions. [2024-11-18 18:53:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:53:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-18 18:53:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:53:51,102 INFO L225 Difference]: With dead ends: 199 [2024-11-18 18:53:51,102 INFO L226 Difference]: Without dead ends: 119 [2024-11-18 18:53:51,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 18:53:51,104 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 149 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:53:51,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 268 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 18:53:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-18 18:53:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2024-11-18 18:53:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-18 18:53:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2024-11-18 18:53:51,130 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 167 [2024-11-18 18:53:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:53:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2024-11-18 18:53:51,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:53:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2024-11-18 18:53:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-18 18:53:51,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:53:51,138 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:53:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 18:53:51,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:53:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:53:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash -930101558, now seen corresponding path program 1 times [2024-11-18 18:53:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:53:51,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630985042] [2024-11-18 18:53:51,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:53:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:53:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:53:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:53:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:53:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630985042] [2024-11-18 18:53:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630985042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:53:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:53:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 18:53:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021377206] [2024-11-18 18:53:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:53:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 18:53:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:53:57,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 18:53:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 18:53:57,895 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:53:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:53:58,513 INFO L93 Difference]: Finished difference Result 197 states and 301 transitions. [2024-11-18 18:53:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 18:53:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-18 18:53:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:53:58,517 INFO L225 Difference]: With dead ends: 197 [2024-11-18 18:53:58,517 INFO L226 Difference]: Without dead ends: 101 [2024-11-18 18:53:58,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-18 18:53:58,519 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 76 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 18:53:58,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 336 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 18:53:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-18 18:53:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2024-11-18 18:53:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-18 18:53:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-18 18:53:58,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 168 [2024-11-18 18:53:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:53:58,534 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-18 18:53:58,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:53:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-18 18:53:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-18 18:53:58,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:53:58,537 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:53:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 18:53:58,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:53:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:53:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 351059748, now seen corresponding path program 1 times [2024-11-18 18:53:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:53:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766718415] [2024-11-18 18:53:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:53:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:53:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766718415] [2024-11-18 18:54:02,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766718415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 18:54:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97869601] [2024-11-18 18:54:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:02,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 18:54:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:02,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 18:54:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-18 18:54:02,741 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:03,846 INFO L93 Difference]: Finished difference Result 353 states and 512 transitions. [2024-11-18 18:54:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 18:54:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-18 18:54:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:03,851 INFO L225 Difference]: With dead ends: 353 [2024-11-18 18:54:03,851 INFO L226 Difference]: Without dead ends: 273 [2024-11-18 18:54:03,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-18 18:54:03,853 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 536 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:03,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 580 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 18:54:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-18 18:54:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 241. [2024-11-18 18:54:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.3426966292134832) internal successors, (239), 180 states have internal predecessors, (239), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-18 18:54:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 355 transitions. [2024-11-18 18:54:03,912 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 355 transitions. Word has length 169 [2024-11-18 18:54:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:03,912 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 355 transitions. [2024-11-18 18:54:03,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 355 transitions. [2024-11-18 18:54:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-18 18:54:03,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:03,919 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:03,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 18:54:03,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -928803930, now seen corresponding path program 1 times [2024-11-18 18:54:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326263490] [2024-11-18 18:54:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:06,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326263490] [2024-11-18 18:54:06,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326263490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:06,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 18:54:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725885450] [2024-11-18 18:54:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:06,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 18:54:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 18:54:06,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-18 18:54:06,712 INFO L87 Difference]: Start difference. First operand 241 states and 355 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:07,819 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions. [2024-11-18 18:54:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 18:54:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-18 18:54:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:07,824 INFO L225 Difference]: With dead ends: 490 [2024-11-18 18:54:07,826 INFO L226 Difference]: Without dead ends: 252 [2024-11-18 18:54:07,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-18 18:54:07,829 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 264 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:07,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 635 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 18:54:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-18 18:54:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2024-11-18 18:54:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 171 states have internal predecessors, (226), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-18 18:54:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2024-11-18 18:54:07,871 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 169 [2024-11-18 18:54:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:07,872 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2024-11-18 18:54:07,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2024-11-18 18:54:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-18 18:54:07,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:07,875 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:07,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 18:54:07,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1237288154, now seen corresponding path program 1 times [2024-11-18 18:54:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:07,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435173620] [2024-11-18 18:54:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435173620] [2024-11-18 18:54:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435173620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 18:54:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207112544] [2024-11-18 18:54:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:09,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 18:54:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 18:54:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-18 18:54:09,551 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:10,395 INFO L93 Difference]: Finished difference Result 513 states and 741 transitions. [2024-11-18 18:54:10,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 18:54:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-18 18:54:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:10,401 INFO L225 Difference]: With dead ends: 513 [2024-11-18 18:54:10,402 INFO L226 Difference]: Without dead ends: 284 [2024-11-18 18:54:10,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-18 18:54:10,404 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 246 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:10,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 609 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 18:54:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-18 18:54:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 219. [2024-11-18 18:54:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 158 states have internal predecessors, (208), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-18 18:54:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2024-11-18 18:54:10,431 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 169 [2024-11-18 18:54:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:10,432 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2024-11-18 18:54:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2024-11-18 18:54:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-18 18:54:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:10,434 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:10,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 18:54:10,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:10,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1777815464, now seen corresponding path program 1 times [2024-11-18 18:54:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454935782] [2024-11-18 18:54:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454935782] [2024-11-18 18:54:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454935782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:12,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 18:54:12,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315756819] [2024-11-18 18:54:12,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:12,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 18:54:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 18:54:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-18 18:54:12,333 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:13,087 INFO L93 Difference]: Finished difference Result 475 states and 691 transitions. [2024-11-18 18:54:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 18:54:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-18 18:54:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:13,092 INFO L225 Difference]: With dead ends: 475 [2024-11-18 18:54:13,092 INFO L226 Difference]: Without dead ends: 263 [2024-11-18 18:54:13,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-11-18 18:54:13,094 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 230 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:13,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 559 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 18:54:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-18 18:54:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 208. [2024-11-18 18:54:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 147 states have internal predecessors, (192), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-18 18:54:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions. [2024-11-18 18:54:13,132 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 169 [2024-11-18 18:54:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions. [2024-11-18 18:54:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions. [2024-11-18 18:54:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:13,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:13,135 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 18:54:13,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 134084039, now seen corresponding path program 1 times [2024-11-18 18:54:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699298457] [2024-11-18 18:54:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:18,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:18,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699298457] [2024-11-18 18:54:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699298457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:18,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-18 18:54:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322474374] [2024-11-18 18:54:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:18,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 18:54:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 18:54:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-18 18:54:18,799 INFO L87 Difference]: Start difference. First operand 208 states and 308 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:22,465 INFO L93 Difference]: Finished difference Result 442 states and 634 transitions. [2024-11-18 18:54:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 18:54:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-18 18:54:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:22,470 INFO L225 Difference]: With dead ends: 442 [2024-11-18 18:54:22,470 INFO L226 Difference]: Without dead ends: 362 [2024-11-18 18:54:22,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-18 18:54:22,472 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 445 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:22,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 660 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-18 18:54:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-18 18:54:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 294. [2024-11-18 18:54:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 223 states have (on average 1.345291479820628) internal successors, (300), 227 states have internal predecessors, (300), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 18:54:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 428 transitions. [2024-11-18 18:54:22,504 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 428 transitions. Word has length 170 [2024-11-18 18:54:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:22,504 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 428 transitions. [2024-11-18 18:54:22,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 428 transitions. [2024-11-18 18:54:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:22,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:22,507 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 18:54:22,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:22,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1145779639, now seen corresponding path program 1 times [2024-11-18 18:54:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477902258] [2024-11-18 18:54:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477902258] [2024-11-18 18:54:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477902258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:28,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-18 18:54:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090867286] [2024-11-18 18:54:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 18:54:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 18:54:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-18 18:54:28,147 INFO L87 Difference]: Start difference. First operand 294 states and 428 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:31,114 INFO L93 Difference]: Finished difference Result 507 states and 728 transitions. [2024-11-18 18:54:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 18:54:31,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-18 18:54:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:31,117 INFO L225 Difference]: With dead ends: 507 [2024-11-18 18:54:31,117 INFO L226 Difference]: Without dead ends: 341 [2024-11-18 18:54:31,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-11-18 18:54:31,121 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 260 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:31,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 645 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-18 18:54:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-18 18:54:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2024-11-18 18:54:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 214 states have (on average 1.341121495327103) internal successors, (287), 218 states have internal predecessors, (287), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-18 18:54:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 415 transitions. [2024-11-18 18:54:31,148 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 415 transitions. Word has length 170 [2024-11-18 18:54:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 415 transitions. [2024-11-18 18:54:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-18 18:54:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 415 transitions. [2024-11-18 18:54:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:31,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:31,150 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:31,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 18:54:31,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:31,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1454263863, now seen corresponding path program 1 times [2024-11-18 18:54:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838825179] [2024-11-18 18:54:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838825179] [2024-11-18 18:54:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838825179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-18 18:54:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037969881] [2024-11-18 18:54:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:36,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 18:54:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 18:54:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-18 18:54:36,065 INFO L87 Difference]: Start difference. First operand 285 states and 415 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:39,157 INFO L93 Difference]: Finished difference Result 526 states and 747 transitions. [2024-11-18 18:54:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 18:54:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-18 18:54:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:39,161 INFO L225 Difference]: With dead ends: 526 [2024-11-18 18:54:39,161 INFO L226 Difference]: Without dead ends: 369 [2024-11-18 18:54:39,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-18 18:54:39,163 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 203 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:39,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1003 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-18 18:54:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-18 18:54:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2024-11-18 18:54:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 229 states have (on average 1.3406113537117903) internal successors, (307), 233 states have internal predecessors, (307), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 18:54:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 439 transitions. [2024-11-18 18:54:39,195 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 439 transitions. Word has length 170 [2024-11-18 18:54:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:39,195 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 439 transitions. [2024-11-18 18:54:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 439 transitions. [2024-11-18 18:54:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:39,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:39,198 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 18:54:39,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1560839755, now seen corresponding path program 1 times [2024-11-18 18:54:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635616657] [2024-11-18 18:54:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635616657] [2024-11-18 18:54:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635616657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-18 18:54:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843045671] [2024-11-18 18:54:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 18:54:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 18:54:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-18 18:54:44,678 INFO L87 Difference]: Start difference. First operand 303 states and 439 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:48,201 INFO L93 Difference]: Finished difference Result 581 states and 820 transitions. [2024-11-18 18:54:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 18:54:48,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-18 18:54:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:48,205 INFO L225 Difference]: With dead ends: 581 [2024-11-18 18:54:48,206 INFO L226 Difference]: Without dead ends: 406 [2024-11-18 18:54:48,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-18 18:54:48,208 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 212 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:48,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 871 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-18 18:54:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-18 18:54:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 322. [2024-11-18 18:54:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.3346938775510204) internal successors, (327), 250 states have internal predecessors, (327), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-18 18:54:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2024-11-18 18:54:48,244 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 170 [2024-11-18 18:54:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2024-11-18 18:54:48,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2024-11-18 18:54:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:48,248 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:48,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 18:54:48,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1218389949, now seen corresponding path program 1 times [2024-11-18 18:54:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740594323] [2024-11-18 18:54:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740594323] [2024-11-18 18:54:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740594323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 18:54:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036174070] [2024-11-18 18:54:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 18:54:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 18:54:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:54:48,318 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:48,412 INFO L93 Difference]: Finished difference Result 847 states and 1202 transitions. [2024-11-18 18:54:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 18:54:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-18 18:54:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:48,429 INFO L225 Difference]: With dead ends: 847 [2024-11-18 18:54:48,429 INFO L226 Difference]: Without dead ends: 532 [2024-11-18 18:54:48,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:54:48,430 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:48,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 204 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 18:54:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-18 18:54:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 422. [2024-11-18 18:54:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 339 states have (on average 1.3539823008849559) internal successors, (459), 345 states have internal predecessors, (459), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 18:54:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-11-18 18:54:48,476 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 170 [2024-11-18 18:54:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-11-18 18:54:48,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-11-18 18:54:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 18:54:48,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:48,479 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 18:54:48,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1587107223, now seen corresponding path program 1 times [2024-11-18 18:54:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446298364] [2024-11-18 18:54:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446298364] [2024-11-18 18:54:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446298364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 18:54:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696080342] [2024-11-18 18:54:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 18:54:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 18:54:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:54:48,640 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:48,768 INFO L93 Difference]: Finished difference Result 830 states and 1185 transitions. [2024-11-18 18:54:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 18:54:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-18 18:54:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:48,773 INFO L225 Difference]: With dead ends: 830 [2024-11-18 18:54:48,773 INFO L226 Difference]: Without dead ends: 411 [2024-11-18 18:54:48,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 18:54:48,775 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 78 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:48,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 311 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 18:54:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-18 18:54:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-18 18:54:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 332 states have internal predecessors, (439), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 18:54:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 583 transitions. [2024-11-18 18:54:48,817 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 583 transitions. Word has length 170 [2024-11-18 18:54:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:48,817 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 583 transitions. [2024-11-18 18:54:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 583 transitions. [2024-11-18 18:54:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-18 18:54:48,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:48,819 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:48,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 18:54:48,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:48,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash -844172460, now seen corresponding path program 1 times [2024-11-18 18:54:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:48,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545276951] [2024-11-18 18:54:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-18 18:54:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545276951] [2024-11-18 18:54:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545276951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:50,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 18:54:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143804444] [2024-11-18 18:54:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:50,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 18:54:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 18:54:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 18:54:50,482 INFO L87 Difference]: Start difference. First operand 409 states and 583 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:51,400 INFO L93 Difference]: Finished difference Result 675 states and 960 transitions. [2024-11-18 18:54:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 18:54:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-18 18:54:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:51,404 INFO L225 Difference]: With dead ends: 675 [2024-11-18 18:54:51,405 INFO L226 Difference]: Without dead ends: 421 [2024-11-18 18:54:51,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 18:54:51,406 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 70 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:51,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 714 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 18:54:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-18 18:54:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 396. [2024-11-18 18:54:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 313 states have (on average 1.3386581469648562) internal successors, (419), 319 states have internal predecessors, (419), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 18:54:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 563 transitions. [2024-11-18 18:54:51,446 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 563 transitions. Word has length 171 [2024-11-18 18:54:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:51,446 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 563 transitions. [2024-11-18 18:54:51,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-18 18:54:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 563 transitions. [2024-11-18 18:54:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-18 18:54:51,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:51,448 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 18:54:51,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1526818079, now seen corresponding path program 1 times [2024-11-18 18:54:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996435289] [2024-11-18 18:54:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 54 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-18 18:54:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996435289] [2024-11-18 18:54:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996435289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643505808] [2024-11-18 18:54:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:51,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:51,772 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-18 18:54:51,773 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-18 18:54:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:51,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 18:54:51,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 750 proven. 54 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-18 18:54:52,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:54:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 57 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-18 18:54:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643505808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 18:54:52,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 18:54:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 20 [2024-11-18 18:54:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361609691] [2024-11-18 18:54:52,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 18:54:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 18:54:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 18:54:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-18 18:54:52,700 INFO L87 Difference]: Start difference. First operand 396 states and 563 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 6 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-18 18:54:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:53,158 INFO L93 Difference]: Finished difference Result 838 states and 1177 transitions. [2024-11-18 18:54:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 18:54:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 6 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) Word has length 171 [2024-11-18 18:54:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:53,162 INFO L225 Difference]: With dead ends: 838 [2024-11-18 18:54:53,162 INFO L226 Difference]: Without dead ends: 445 [2024-11-18 18:54:53,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-11-18 18:54:53,164 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 241 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:53,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 568 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 18:54:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-18 18:54:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 421. [2024-11-18 18:54:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 334 states have (on average 1.3173652694610778) internal successors, (440), 340 states have internal predecessors, (440), 72 states have call successors, (72), 14 states have call predecessors, (72), 14 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 18:54:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 584 transitions. [2024-11-18 18:54:53,213 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 584 transitions. Word has length 171 [2024-11-18 18:54:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:53,213 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 584 transitions. [2024-11-18 18:54:53,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 6 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-18 18:54:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions. [2024-11-18 18:54:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-18 18:54:53,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:53,215 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:53,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 18:54:53,415 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,SelfDestructingSolverStorable14 [2024-11-18 18:54:53,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:53,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1757031967, now seen corresponding path program 1 times [2024-11-18 18:54:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13144657] [2024-11-18 18:54:53,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 18:54:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884062745] [2024-11-18 18:54:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:53,494 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-18 18:54:53,495 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-18 18:54:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:54:53,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 18:54:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:54:53,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 18:54:53,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 18:54:53,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 18:54:53,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 18:54:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:53,964 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:54,085 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 18:54:54,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:54:54 BoogieIcfgContainer [2024-11-18 18:54:54,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 18:54:54,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 18:54:54,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 18:54:54,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 18:54:54,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:53:41" (3/4) ... [2024-11-18 18:54:54,092 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 18:54:54,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 18:54:54,093 INFO L158 Benchmark]: Toolchain (without parser) took 74144.90ms. Allocated memory was 161.5MB in the beginning and 629.1MB in the end (delta: 467.7MB). Free memory was 131.8MB in the beginning and 346.7MB in the end (delta: -214.9MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,093 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:54:54,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 116.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.34ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 112.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,094 INFO L158 Benchmark]: Boogie Preprocessor took 76.68ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 106.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,095 INFO L158 Benchmark]: RCFGBuilder took 754.29ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 111.5MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,095 INFO L158 Benchmark]: TraceAbstraction took 72866.31ms. Allocated memory was 161.5MB in the beginning and 629.1MB in the end (delta: 467.7MB). Free memory was 110.4MB in the beginning and 346.7MB in the end (delta: -236.3MB). Peak memory consumption was 233.3MB. Max. memory is 16.1GB. [2024-11-18 18:54:54,095 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 629.1MB. Free memory is still 346.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:54:54,096 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.19ms. Allocated memory is still 161.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 116.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.34ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 112.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.68ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 106.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 754.29ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 111.5MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 72866.31ms. Allocated memory was 161.5MB in the beginning and 629.1MB in the end (delta: 467.7MB). Free memory was 110.4MB in the beginning and 346.7MB in the end (delta: -236.3MB). Peak memory consumption was 233.3MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 629.1MB. Free memory is still 346.7MB. 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 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] var_1_3 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] var_1_4 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L92] var_1_5 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L95] var_1_7 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L96] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L97] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L98] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L99] var_1_8 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] var_1_10 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] var_1_14 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] var_1_16 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L115] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L117] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L118] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L119] var_1_21 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L120] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L133] RET updateVariables() [L134] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L49] signed long int stepLocal_1 = -16; [L50] signed long int stepLocal_0 = var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L51] COND FALSE !(-4 > stepLocal_0) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L56] EXPR var_1_8 & var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L56] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L61] var_1_9 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L63] COND TRUE var_1_3 <= var_1_1 [L64] var_1_12 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L68] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_1=-16, stepLocal_2=0, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L69] COND TRUE (~ var_1_3) < stepLocal_2 [L70] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L72] signed long int stepLocal_3 = var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))); VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L73] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L73] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= stepLocal_3 [L74] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L78] var_1_18 = var_1_17 [L79] var_1_19 = 0 [L80] var_1_20 = var_1_21 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L125-L126] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.7s, OverallIterations: 16, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3066 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3051 mSDsluCounter, 8089 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6220 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8608 IncrementalHoareTripleChecker+Invalid, 8887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 1869 mSDtfsCounter, 8608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=12, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 645 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 48.9s InterpolantComputationTime, 3220 NumberOfCodeBlocks, 3220 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3031 ConstructedInterpolants, 0 QuantifiedInterpolants, 25116 SizeOfPredicates, 5 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 23185/23400 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-18 18:54:54,311 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-18 18:54:54,341 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:54:56,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:54:56,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 18:54:56,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:54:56,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:54:56,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:54:56,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:54:56,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:54:56,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:54:56,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:54:56,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:54:56,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:54:56,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:54:56,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:54:56,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:54:56,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:54:56,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:54:56,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:54:56,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:54:56,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:54:56,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:54:56,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:54:56,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:54:56,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 18:54:56,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 18:54:56,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:54:56,446 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 18:54:56,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:54:56,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:54:56,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:54:56,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:54:56,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:54:56,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:54:56,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:54:56,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:54:56,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:54:56,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:54:56,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:54:56,451 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 18:54:56,451 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 18:54:56,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:54:56,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:54:56,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:54:56,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:54:56,453 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2024-11-18 18:54:56,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:54:56,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:54:56,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:54:56,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:54:56,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:54:56,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i