./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:46:31,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:46:31,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:46:31,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:46:31,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:46:31,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:46:31,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:46:31,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:46:31,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:46:31,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:46:31,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:46:31,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:46:31,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:46:31,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:46:31,988 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:46:31,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:46:31,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:46:31,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:46:31,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:46:31,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:46:31,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:46:31,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:46:31,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:46:31,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:46:31,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:46:31,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:46:31,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:46:31,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:46:31,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:46:31,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:46:31,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:46:31,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:46:31,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:46:31,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:46:31,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:46:31,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:46:31,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:46:31,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:46:31,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:46:31,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:46:31,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:46:31,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:46:31,999 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-10-13 04:46:32,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:46:32,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:46:32,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:46:32,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:46:32,295 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:46:32,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:46:33,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:46:33,960 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:46:33,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:46:33,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f7cde08/dc2440386c8d461baf53d6ea8f36e2fd/FLAGdbd244b3c [2024-10-13 04:46:33,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f7cde08/dc2440386c8d461baf53d6ea8f36e2fd [2024-10-13 04:46:33,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:46:33,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:46:33,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:46:33,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:46:33,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:46:34,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:46:33" (1/1) ... [2024-10-13 04:46:34,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7342dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34, skipping insertion in model container [2024-10-13 04:46:34,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:46:33" (1/1) ... [2024-10-13 04:46:34,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:46:34,183 WARN L248 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_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-10-13 04:46:34,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:46:34,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:46:34,298 WARN L248 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_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-10-13 04:46:34,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:46:34,347 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:46:34,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34 WrapperNode [2024-10-13 04:46:34,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:46:34,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:46:34,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:46:34,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:46:34,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,392 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-13 04:46:34,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:46:34,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:46:34,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:46:34,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:46:34,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,430 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-10-13 04:46:34,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:46:34,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:46:34,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:46:34,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:46:34,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (1/1) ... [2024-10-13 04:46:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:46:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:46:34,505 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-10-13 04:46:34,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-10-13 04:46:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:46:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:46:34,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:46:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:46:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:46:34,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:46:34,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:46:34,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:46:35,003 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 04:46:35,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:46:35,053 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:46:35,054 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:46:35,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:46:35 BoogieIcfgContainer [2024-10-13 04:46:35,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:46:35,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:46:35,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:46:35,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:46:35,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:46:33" (1/3) ... [2024-10-13 04:46:35,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda3a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:46:35, skipping insertion in model container [2024-10-13 04:46:35,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:46:34" (2/3) ... [2024-10-13 04:46:35,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda3a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:46:35, skipping insertion in model container [2024-10-13 04:46:35,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:46:35" (3/3) ... [2024-10-13 04:46:35,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:46:35,080 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:46:35,080 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:46:35,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:46:35,154 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;@63412a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:46:35,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:46:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 04:46:35,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:35,168 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:35,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:35,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1795745291, now seen corresponding path program 1 times [2024-10-13 04:46:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354251087] [2024-10-13 04:46:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354251087] [2024-10-13 04:46:35,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354251087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:35,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:35,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:46:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512805715] [2024-10-13 04:46:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:35,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:46:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:46:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:46:35,615 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:35,673 INFO L93 Difference]: Finished difference Result 133 states and 219 transitions. [2024-10-13 04:46:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:46:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-13 04:46:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:35,687 INFO L225 Difference]: With dead ends: 133 [2024-10-13 04:46:35,688 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 04:46:35,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-10-13 04:46:35,697 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:35,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:46:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 04:46:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 04:46:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-13 04:46:35,751 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 104 [2024-10-13 04:46:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:35,752 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-13 04:46:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-13 04:46:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 04:46:35,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:35,758 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:46:35,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash 373695249, now seen corresponding path program 1 times [2024-10-13 04:46:35,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:35,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495636456] [2024-10-13 04:46:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495636456] [2024-10-13 04:46:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495636456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:46:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34309716] [2024-10-13 04:46:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:36,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:46:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:46:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:46:36,117 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:36,148 INFO L93 Difference]: Finished difference Result 132 states and 197 transitions. [2024-10-13 04:46:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:46:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-13 04:46:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:36,151 INFO L225 Difference]: With dead ends: 132 [2024-10-13 04:46:36,151 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 04:46:36,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-13 04:46:36,153 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:36,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:46:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 04:46:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 04:46:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-10-13 04:46:36,165 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 104 [2024-10-13 04:46:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-10-13 04:46:36,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-10-13 04:46:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 04:46:36,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:36,171 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:36,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:46:36,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -191790430, now seen corresponding path program 1 times [2024-10-13 04:46:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280256672] [2024-10-13 04:46:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280256672] [2024-10-13 04:46:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280256672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:46:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405917192] [2024-10-13 04:46:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:46:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:46:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:46:39,789 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:42,365 INFO L93 Difference]: Finished difference Result 244 states and 354 transitions. [2024-10-13 04:46:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:46:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-10-13 04:46:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:42,370 INFO L225 Difference]: With dead ends: 244 [2024-10-13 04:46:42,370 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 04:46:42,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:46:42,375 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 617 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:42,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 278 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 04:46:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 04:46:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 97. [2024-10-13 04:46:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-13 04:46:42,404 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 105 [2024-10-13 04:46:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:42,407 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-13 04:46:42,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-13 04:46:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 04:46:42,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:42,409 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:46:42,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1471654108, now seen corresponding path program 1 times [2024-10-13 04:46:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834601009] [2024-10-13 04:46:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834601009] [2024-10-13 04:46:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834601009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:44,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:46:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159863854] [2024-10-13 04:46:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:46:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:46:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:46:44,291 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:44,905 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2024-10-13 04:46:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:46:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-13 04:46:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:44,908 INFO L225 Difference]: With dead ends: 232 [2024-10-13 04:46:44,908 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 04:46:44,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:46:44,910 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 91 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:44,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 393 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:46:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 04:46:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2024-10-13 04:46:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-10-13 04:46:44,921 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 105 [2024-10-13 04:46:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:44,922 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-10-13 04:46:44,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-10-13 04:46:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 04:46:44,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:44,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:44,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:46:44,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2109032160, now seen corresponding path program 1 times [2024-10-13 04:46:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408531411] [2024-10-13 04:46:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408531411] [2024-10-13 04:46:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408531411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 04:46:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90193259] [2024-10-13 04:46:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:48,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:46:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:46:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:46:48,280 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:52,029 INFO L93 Difference]: Finished difference Result 486 states and 709 transitions. [2024-10-13 04:46:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:46:52,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-10-13 04:46:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:52,033 INFO L225 Difference]: With dead ends: 486 [2024-10-13 04:46:52,034 INFO L226 Difference]: Without dead ends: 392 [2024-10-13 04:46:52,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:46:52,037 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 444 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:52,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 783 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 04:46:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-13 04:46:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 257. [2024-10-13 04:46:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 205 states have internal predecessors, (288), 45 states have call successors, (45), 6 states have call predecessors, (45), 6 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:46:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2024-10-13 04:46:52,098 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 105 [2024-10-13 04:46:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2024-10-13 04:46:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:46:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2024-10-13 04:46:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 04:46:52,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:52,103 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:46:52,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 829168482, now seen corresponding path program 1 times [2024-10-13 04:46:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544357194] [2024-10-13 04:46:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:54,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544357194] [2024-10-13 04:46:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544357194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:46:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900516280] [2024-10-13 04:46:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:46:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:46:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:46:54,163 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:55,295 INFO L93 Difference]: Finished difference Result 429 states and 628 transitions. [2024-10-13 04:46:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:46:55,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-13 04:46:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:55,298 INFO L225 Difference]: With dead ends: 429 [2024-10-13 04:46:55,298 INFO L226 Difference]: Without dead ends: 335 [2024-10-13 04:46:55,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:46:55,300 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:55,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 502 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:46:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-13 04:46:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 97. [2024-10-13 04:46:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-13 04:46:55,325 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 105 [2024-10-13 04:46:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:55,326 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-13 04:46:55,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-13 04:46:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 04:46:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:55,329 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:46:55,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1291383710, now seen corresponding path program 1 times [2024-10-13 04:46:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015623597] [2024-10-13 04:46:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015623597] [2024-10-13 04:46:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015623597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:56,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:56,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:46:56,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533898184] [2024-10-13 04:46:56,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:56,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:46:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:46:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:46:56,136 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:56,664 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-10-13 04:46:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:46:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-13 04:46:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:56,666 INFO L225 Difference]: With dead ends: 234 [2024-10-13 04:46:56,667 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 04:46:56,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:46:56,668 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 91 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:56,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 450 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:46:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 04:46:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 73. [2024-10-13 04:46:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-10-13 04:46:56,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 105 [2024-10-13 04:46:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:56,681 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-10-13 04:46:56,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:46:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-10-13 04:46:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:46:56,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:56,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:56,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:46:56,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:56,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash 19073959, now seen corresponding path program 1 times [2024-10-13 04:46:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288251383] [2024-10-13 04:46:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 04:46:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288251383] [2024-10-13 04:46:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288251383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:46:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394822662] [2024-10-13 04:46:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:56,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:46:56,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:46:56,868 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-10-13 04:46:56,869 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-10-13 04:46:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:56,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 04:46:56,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:46:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-13 04:46:57,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:46:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 04:46:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394822662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:46:57,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:46:57,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-13 04:46:57,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135355852] [2024-10-13 04:46:57,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:46:57,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:46:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:46:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:46:57,489 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-13 04:46:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:57,708 INFO L93 Difference]: Finished difference Result 151 states and 212 transitions. [2024-10-13 04:46:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:46:57,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 107 [2024-10-13 04:46:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:57,710 INFO L225 Difference]: With dead ends: 151 [2024-10-13 04:46:57,710 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 04:46:57,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-10-13 04:46:57,711 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 197 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:57,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 156 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:46:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 04:46:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-13 04:46:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-10-13 04:46:57,721 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 107 [2024-10-13 04:46:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-10-13 04:46:57,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-13 04:46:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-10-13 04:46:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:46:57,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:57,723 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:57,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:46:57,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:46:57,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:57,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1569273943, now seen corresponding path program 1 times [2024-10-13 04:46:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199770789] [2024-10-13 04:46:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:46:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868243748] [2024-10-13 04:46:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:46:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:46:57,988 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-10-13 04:46:57,989 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-10-13 04:46:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:58,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 04:46:58,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:46:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-13 04:46:58,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:46:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 04:46:58,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:58,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199770789] [2024-10-13 04:46:58,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:46:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868243748] [2024-10-13 04:46:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868243748] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:46:58,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:46:58,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 04:46:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736275911] [2024-10-13 04:46:58,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:46:58,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 04:46:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 04:46:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-13 04:46:58,816 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:46:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:46:59,586 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2024-10-13 04:46:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:46:59,586 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 107 [2024-10-13 04:46:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:46:59,588 INFO L225 Difference]: With dead ends: 241 [2024-10-13 04:46:59,589 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 04:46:59,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-13 04:46:59,594 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 286 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:46:59,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 645 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:46:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 04:46:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-13 04:46:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:46:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-10-13 04:46:59,612 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 107 [2024-10-13 04:46:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:46:59,613 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-10-13 04:46:59,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:46:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-10-13 04:46:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:46:59,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:46:59,615 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:46:59,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 04:46:59,815 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,SelfDestructingSolverStorable8 [2024-10-13 04:46:59,816 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:46:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:46:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 495033522, now seen corresponding path program 1 times [2024-10-13 04:46:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:46:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757987659] [2024-10-13 04:46:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:46:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:46:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:46:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:46:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:46:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:46:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:46:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:46:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:46:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:46:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:46:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:46:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:46:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:46:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:46:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:46:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:46:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:46:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:46:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:46:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757987659] [2024-10-13 04:46:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757987659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:46:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:46:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:46:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517515466] [2024-10-13 04:46:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:46:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:46:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:46:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:46:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:46:59,888 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:00,003 INFO L93 Difference]: Finished difference Result 280 states and 377 transitions. [2024-10-13 04:47:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:47:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-13 04:47:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:00,006 INFO L225 Difference]: With dead ends: 280 [2024-10-13 04:47:00,006 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 04:47:00,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-13 04:47:00,007 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:00,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 185 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:47:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 04:47:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-13 04:47:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:47:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-10-13 04:47:00,021 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 107 [2024-10-13 04:47:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:00,022 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-10-13 04:47:00,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-10-13 04:47:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:47:00,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:00,023 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:00,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:47:00,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:00,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 643315218, now seen corresponding path program 1 times [2024-10-13 04:47:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358451393] [2024-10-13 04:47:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:47:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:47:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:47:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:47:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:47:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:47:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:47:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:47:00,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358451393] [2024-10-13 04:47:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358451393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:00,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:47:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954785707] [2024-10-13 04:47:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:00,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:47:00,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:47:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:47:00,874 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:01,527 INFO L93 Difference]: Finished difference Result 467 states and 619 transitions. [2024-10-13 04:47:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:47:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-13 04:47:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:01,530 INFO L225 Difference]: With dead ends: 467 [2024-10-13 04:47:01,531 INFO L226 Difference]: Without dead ends: 352 [2024-10-13 04:47:01,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:47:01,533 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 177 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:01,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 583 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:47:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-13 04:47:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 233. [2024-10-13 04:47:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 199 states have internal predecessors, (264), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:47:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2024-10-13 04:47:01,555 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 107 [2024-10-13 04:47:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:01,558 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2024-10-13 04:47:01,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2024-10-13 04:47:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:47:01,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:01,559 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 04:47:01,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:01,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash -174333232, now seen corresponding path program 1 times [2024-10-13 04:47:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950002009] [2024-10-13 04:47:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:47:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:47:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:47:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:47:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:47:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:47:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:47:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:47:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:01,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950002009] [2024-10-13 04:47:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950002009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:01,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:47:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527911482] [2024-10-13 04:47:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:01,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:47:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:47:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:47:01,870 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:02,232 INFO L93 Difference]: Finished difference Result 677 states and 898 transitions. [2024-10-13 04:47:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:47:02,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-13 04:47:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:02,237 INFO L225 Difference]: With dead ends: 677 [2024-10-13 04:47:02,237 INFO L226 Difference]: Without dead ends: 445 [2024-10-13 04:47:02,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:47:02,239 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 133 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:02,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 393 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:47:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-13 04:47:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 240. [2024-10-13 04:47:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 205 states have (on average 1.3365853658536586) internal successors, (274), 206 states have internal predecessors, (274), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:47:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-10-13 04:47:02,266 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 107 [2024-10-13 04:47:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:02,266 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-10-13 04:47:02,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-10-13 04:47:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 04:47:02,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:02,268 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:02,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 04:47:02,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 535066765, now seen corresponding path program 1 times [2024-10-13 04:47:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232740411] [2024-10-13 04:47:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:47:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:47:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:47:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:47:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:47:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:47:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:47:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:47:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232740411] [2024-10-13 04:47:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232740411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 04:47:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074213357] [2024-10-13 04:47:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:47:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:47:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:47:04,045 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:05,438 INFO L93 Difference]: Finished difference Result 663 states and 891 transitions. [2024-10-13 04:47:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 04:47:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-13 04:47:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:05,442 INFO L225 Difference]: With dead ends: 663 [2024-10-13 04:47:05,442 INFO L226 Difference]: Without dead ends: 424 [2024-10-13 04:47:05,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:47:05,444 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 313 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:05,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 516 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:47:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-13 04:47:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 294. [2024-10-13 04:47:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 259 states have (on average 1.335907335907336) internal successors, (346), 260 states have internal predecessors, (346), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:47:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2024-10-13 04:47:05,477 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 108 [2024-10-13 04:47:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:05,478 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2024-10-13 04:47:05,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2024-10-13 04:47:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 04:47:05,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:05,480 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:05,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 04:47:05,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 683348461, now seen corresponding path program 1 times [2024-10-13 04:47:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590185018] [2024-10-13 04:47:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:47:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:47:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:47:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:47:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:47:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:47:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:47:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:47:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:47:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590185018] [2024-10-13 04:47:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590185018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:05,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:47:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130736763] [2024-10-13 04:47:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:47:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:47:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:47:05,869 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:06,562 INFO L93 Difference]: Finished difference Result 851 states and 1147 transitions. [2024-10-13 04:47:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:47:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-13 04:47:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:06,566 INFO L225 Difference]: With dead ends: 851 [2024-10-13 04:47:06,566 INFO L226 Difference]: Without dead ends: 558 [2024-10-13 04:47:06,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:47:06,572 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 165 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:06,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 586 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:47:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-13 04:47:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 470. [2024-10-13 04:47:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 401 states have (on average 1.2967581047381547) internal successors, (520), 403 states have internal predecessors, (520), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:47:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 624 transitions. [2024-10-13 04:47:06,666 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 624 transitions. Word has length 108 [2024-10-13 04:47:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 624 transitions. [2024-10-13 04:47:06,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 624 transitions. [2024-10-13 04:47:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 04:47:06,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:06,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 04:47:06,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:06,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387724, now seen corresponding path program 1 times [2024-10-13 04:47:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581850834] [2024-10-13 04:47:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:47:06,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366027323] [2024-10-13 04:47:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:06,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:06,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:06,714 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-10-13 04:47:06,716 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-10-13 04:47:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:07,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:47:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:07,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:47:07,154 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:47:07,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:47:07,169 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-10-13 04:47:07,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:07,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:07,447 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:47:07,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:47:07 BoogieIcfgContainer [2024-10-13 04:47:07,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:47:07,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:47:07,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:47:07,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:47:07,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:46:35" (3/4) ... [2024-10-13 04:47:07,453 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:47:07,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:47:07,455 INFO L158 Benchmark]: Toolchain (without parser) took 33465.73ms. Allocated memory was 186.6MB in the beginning and 398.5MB in the end (delta: 211.8MB). Free memory was 130.3MB in the beginning and 303.5MB in the end (delta: -173.3MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,455 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:07,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.40ms. Allocated memory is still 186.6MB. Free memory was 129.9MB in the beginning and 151.0MB in the end (delta: -21.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.03ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,455 INFO L158 Benchmark]: Boogie Preprocessor took 66.16ms. Allocated memory is still 186.6MB. Free memory was 148.9MB in the beginning and 144.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,456 INFO L158 Benchmark]: RCFGBuilder took 589.47ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 121.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,456 INFO L158 Benchmark]: TraceAbstraction took 32394.32ms. Allocated memory was 186.6MB in the beginning and 398.5MB in the end (delta: 211.8MB). Free memory was 120.7MB in the beginning and 303.5MB in the end (delta: -182.9MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-10-13 04:47:07,456 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 398.5MB. Free memory is still 303.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:07,457 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.20ms. Allocated memory is still 94.4MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.40ms. Allocated memory is still 186.6MB. Free memory was 129.9MB in the beginning and 151.0MB in the end (delta: -21.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.03ms. Allocated memory is still 186.6MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.16ms. Allocated memory is still 186.6MB. Free memory was 148.9MB in the beginning and 144.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 589.47ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 121.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32394.32ms. Allocated memory was 186.6MB in the beginning and 398.5MB in the end (delta: 211.8MB). Free memory was 120.7MB in the beginning and 303.5MB in the end (delta: -182.9MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 398.5MB. Free memory is still 303.5MB. 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 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-1271, stepLocal_4=9, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-1271, var_1_11=-1271, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=9, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.2s, OverallIterations: 15, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2689 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2683 mSDsluCounter, 5748 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4276 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4936 IncrementalHoareTripleChecker+Invalid, 5109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 1472 mSDtfsCounter, 4936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 987 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=14, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1202 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 1914 NumberOfCodeBlocks, 1914 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1788 ConstructedInterpolants, 0 QuantifiedInterpolants, 9011 SizeOfPredicates, 9 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 6954/7140 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-10-13 04:47:07,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:09,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:09,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:47:09,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:09,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:09,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:09,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:09,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:09,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:09,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:09,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:09,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:09,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:09,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:09,943 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:09,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:09,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:09,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:09,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:09,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:09,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:09,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:09,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:09,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:47:09,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:47:09,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:09,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:47:09,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:09,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:09,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:09,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:09,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:09,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:09,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:09,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:09,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:09,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:09,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:09,956 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:47:09,956 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:47:09,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:09,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:09,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:09,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:09,960 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:47:09,960 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-10-13 04:47:10,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:10,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:10,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:10,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:10,354 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:10,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:47:11,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:12,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:12,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:47:12,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52bc2f35/7f7db826deb344e9a23da4dcf9a83dba/FLAG72d2395d6 [2024-10-13 04:47:12,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52bc2f35/7f7db826deb344e9a23da4dcf9a83dba [2024-10-13 04:47:12,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:12,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:12,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:12,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:12,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:12,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af9c950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12, skipping insertion in model container [2024-10-13 04:47:12,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:12,454 WARN L248 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_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-10-13 04:47:12,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:12,563 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:12,577 WARN L248 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_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-10-13 04:47:12,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:12,640 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:12,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12 WrapperNode [2024-10-13 04:47:12,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:12,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:12,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:12,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:12,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,702 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-13 04:47:12,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:12,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:12,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:12,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:12,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,738 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-10-13 04:47:12,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:12,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:12,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:12,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:12,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (1/1) ... [2024-10-13 04:47:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:12,815 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-10-13 04:47:12,819 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-10-13 04:47:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:47:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:12,938 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:12,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:47:13,385 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 04:47:13,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:47:13,462 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:47:13,462 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:47:13,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:13 BoogieIcfgContainer [2024-10-13 04:47:13,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:47:13,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:47:13,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:47:13,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:47:13,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:12" (1/3) ... [2024-10-13 04:47:13,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2492b877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:13, skipping insertion in model container [2024-10-13 04:47:13,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:12" (2/3) ... [2024-10-13 04:47:13,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2492b877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:13, skipping insertion in model container [2024-10-13 04:47:13,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:13" (3/3) ... [2024-10-13 04:47:13,478 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-10-13 04:47:13,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:47:13,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:47:13,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:47:13,580 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;@a2389d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:47:13,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:47:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:47:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 04:47:13,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:13,597 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:13,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:13,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2001609788, now seen corresponding path program 1 times [2024-10-13 04:47:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066659790] [2024-10-13 04:47:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:13,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:13,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:47:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:47:13,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:47:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:47:13,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:47:13,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:47:13,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066659790] [2024-10-13 04:47:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066659790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:47:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062639943] [2024-10-13 04:47:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:13,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:47:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:47:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:47:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:13,942 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:14,044 INFO L93 Difference]: Finished difference Result 95 states and 165 transitions. [2024-10-13 04:47:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:47:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-13 04:47:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:14,079 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:47:14,083 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:47:14,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-10-13 04:47:14,094 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:14,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:47:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:47:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:47:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:47:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-13 04:47:14,151 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 96 [2024-10-13 04:47:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-13 04:47:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 04:47:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-13 04:47:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 04:47:14,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:14,160 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:47:14,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:47:14,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:14,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1332527400, now seen corresponding path program 1 times [2024-10-13 04:47:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188142846] [2024-10-13 04:47:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:14,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:14,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:47:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:14,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 04:47:14,571 INFO L278 TraceCheckSpWp]: Computing forward predicates...