/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/watermelon.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 04:00:16,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 04:00:16,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 04:00:16,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 04:00:16,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 04:00:16,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 04:00:16,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 04:00:16,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 04:00:16,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 04:00:16,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 04:00:16,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 04:00:16,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 04:00:16,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 04:00:16,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 04:00:16,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 04:00:16,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 04:00:16,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 04:00:16,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 04:00:16,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 04:00:16,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 04:00:16,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 04:00:16,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 04:00:16,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 04:00:16,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 04:00:16,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 04:00:16,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 04:00:16,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 04:00:16,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 04:00:16,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 04:00:16,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 04:00:16,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 04:00:16,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 04:00:16,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 04:00:16,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 04:00:16,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 04:00:16,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 04:00:16,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 04:00:16,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 04:00:16,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 04:00:16,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 04:00:16,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 04:00:17,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-24 04:00:17,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 04:00:17,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 04:00:17,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 04:00:17,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 04:00:17,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 04:00:17,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 04:00:17,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 04:00:17,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-24 04:00:17,014 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 04:00:17,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 04:00:17,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 04:00:17,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 04:00:17,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 04:00:17,303 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 04:00:17,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-02-24 04:00:17,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae00cf30/3ac5f8b424e647368145e66e08e5197f/FLAGdd561ebf8 [2022-02-24 04:00:17,844 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 04:00:17,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-02-24 04:00:17,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae00cf30/3ac5f8b424e647368145e66e08e5197f/FLAGdd561ebf8 [2022-02-24 04:00:17,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae00cf30/3ac5f8b424e647368145e66e08e5197f [2022-02-24 04:00:17,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 04:00:17,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 04:00:17,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 04:00:17,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 04:00:17,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 04:00:17,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:00:17" (1/1) ... [2022-02-24 04:00:17,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19240f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:17, skipping insertion in model container [2022-02-24 04:00:17,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:00:17" (1/1) ... [2022-02-24 04:00:17,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 04:00:17,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 04:00:18,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c[373,386] [2022-02-24 04:00:18,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 04:00:18,154 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 04:00:18,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c[373,386] [2022-02-24 04:00:18,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 04:00:18,198 INFO L208 MainTranslator]: Completed translation [2022-02-24 04:00:18,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18 WrapperNode [2022-02-24 04:00:18,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 04:00:18,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 04:00:18,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 04:00:18,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 04:00:18,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 04:00:18,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 04:00:18,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 04:00:18,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 04:00:18,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (1/1) ... [2022-02-24 04:00:18,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 04:00:18,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 04:00:18,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-24 04:00:18,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-24 04:00:18,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 04:00:18,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 04:00:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 04:00:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 04:00:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-02-24 04:00:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-02-24 04:00:18,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 04:00:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 04:00:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 04:00:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 04:00:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 04:00:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-24 04:00:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 04:00:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-02-24 04:00:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-02-24 04:00:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 04:00:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 04:00:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 04:00:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 04:00:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 04:00:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 04:00:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 04:00:18,384 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 04:00:18,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 04:00:18,495 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 04:00:18,500 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 04:00:18,500 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-24 04:00:18,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:00:18 BoogieIcfgContainer [2022-02-24 04:00:18,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 04:00:18,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 04:00:18,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 04:00:18,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 04:00:18,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 04:00:17" (1/3) ... [2022-02-24 04:00:18,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b44d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:00:18, skipping insertion in model container [2022-02-24 04:00:18,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:00:18" (2/3) ... [2022-02-24 04:00:18,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b44d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:00:18, skipping insertion in model container [2022-02-24 04:00:18,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:00:18" (3/3) ... [2022-02-24 04:00:18,520 INFO L111 eAbstractionObserver]: Analyzing ICFG watermelon.c [2022-02-24 04:00:18,533 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 04:00:18,533 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 04:00:18,577 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 04:00:18,589 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=QVASR [2022-02-24 04:00:18,589 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 04:00:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-24 04:00:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 04:00:18,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:18,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:18,625 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 345664661, now seen corresponding path program 1 times [2022-02-24 04:00:18,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:18,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036395699] [2022-02-24 04:00:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:18,699 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:00:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 04:00:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:19,103 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:19,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036395699] [2022-02-24 04:00:19,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1036395699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:19,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:19,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 04:00:19,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960905222] [2022-02-24 04:00:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:19,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 04:00:19,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 04:00:19,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-02-24 04:00:19,142 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:19,768 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-02-24 04:00:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 04:00:19,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-24 04:00:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:19,783 INFO L225 Difference]: With dead ends: 91 [2022-02-24 04:00:19,783 INFO L226 Difference]: Without dead ends: 42 [2022-02-24 04:00:19,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-02-24 04:00:19,792 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:19,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 89 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 04:00:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-24 04:00:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-24 04:00:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-02-24 04:00:19,825 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2022-02-24 04:00:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:19,826 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-02-24 04:00:19,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-02-24 04:00:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 04:00:19,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:19,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:19,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 04:00:19,828 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1324779677, now seen corresponding path program 1 times [2022-02-24 04:00:19,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:19,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348277191] [2022-02-24 04:00:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:19,832 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:00:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 04:00:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:19,893 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:19,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348277191] [2022-02-24 04:00:19,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [348277191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:19,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:19,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:00:19,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540321873] [2022-02-24 04:00:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:19,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:00:19,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:00:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:00:19,899 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:19,973 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-24 04:00:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:00:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-24 04:00:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:19,976 INFO L225 Difference]: With dead ends: 55 [2022-02-24 04:00:19,976 INFO L226 Difference]: Without dead ends: 42 [2022-02-24 04:00:19,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:00:19,982 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:19,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 04:00:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-24 04:00:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-02-24 04:00:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-02-24 04:00:20,008 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2022-02-24 04:00:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:20,010 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-02-24 04:00:20,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-24 04:00:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 04:00:20,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:20,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:20,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 04:00:20,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:20,017 INFO L85 PathProgramCache]: Analyzing trace with hash -855151641, now seen corresponding path program 1 times [2022-02-24 04:00:20,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:20,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251110010] [2022-02-24 04:00:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:20,020 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 04:00:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-24 04:00:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:20,117 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:20,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251110010] [2022-02-24 04:00:20,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1251110010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:20,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:20,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 04:00:20,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347549202] [2022-02-24 04:00:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:20,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 04:00:20,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 04:00:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 04:00:20,120 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:20,196 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-02-24 04:00:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 04:00:20,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-24 04:00:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:20,198 INFO L225 Difference]: With dead ends: 72 [2022-02-24 04:00:20,198 INFO L226 Difference]: Without dead ends: 43 [2022-02-24 04:00:20,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-24 04:00:20,205 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:20,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 04:00:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-24 04:00:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-02-24 04:00:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-02-24 04:00:20,219 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 27 [2022-02-24 04:00:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:20,220 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-02-24 04:00:20,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-24 04:00:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 04:00:20,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:20,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:20,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 04:00:20,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash 743790053, now seen corresponding path program 1 times [2022-02-24 04:00:20,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:20,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246179187] [2022-02-24 04:00:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:20,338 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 04:00:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:20,535 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:20,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246179187] [2022-02-24 04:00:20,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246179187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:20,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:20,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 04:00:20,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68624212] [2022-02-24 04:00:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:20,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 04:00:20,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 04:00:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-24 04:00:20,537 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:20,632 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-02-24 04:00:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-24 04:00:20,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-02-24 04:00:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:20,634 INFO L225 Difference]: With dead ends: 58 [2022-02-24 04:00:20,634 INFO L226 Difference]: Without dead ends: 45 [2022-02-24 04:00:20,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-24 04:00:20,642 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:20,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 04:00:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-24 04:00:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-02-24 04:00:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-24 04:00:20,673 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2022-02-24 04:00:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:20,673 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-24 04:00:20,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-24 04:00:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 04:00:20,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:20,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:20,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 04:00:20,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 198429957, now seen corresponding path program 1 times [2022-02-24 04:00:20,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:20,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772269540] [2022-02-24 04:00:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:20,735 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 04:00:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:21,088 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:21,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772269540] [2022-02-24 04:00:21,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1772269540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:21,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:21,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 04:00:21,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292631729] [2022-02-24 04:00:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:21,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 04:00:21,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 04:00:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-24 04:00:21,093 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:21,356 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-02-24 04:00:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 04:00:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-24 04:00:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:21,359 INFO L225 Difference]: With dead ends: 60 [2022-02-24 04:00:21,359 INFO L226 Difference]: Without dead ends: 51 [2022-02-24 04:00:21,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-02-24 04:00:21,361 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:21,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 72 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-02-24 04:00:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-24 04:00:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-02-24 04:00:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-02-24 04:00:21,375 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2022-02-24 04:00:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:21,375 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-02-24 04:00:21,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-02-24 04:00:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-24 04:00:21,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:21,383 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:21,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 04:00:21,384 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 69442535, now seen corresponding path program 2 times [2022-02-24 04:00:21,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:21,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137066404] [2022-02-24 04:00:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:21,432 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:21,477 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 04:00:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:21,760 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:21,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137066404] [2022-02-24 04:00:21,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [137066404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:21,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:21,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 04:00:21,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240807148] [2022-02-24 04:00:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:21,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 04:00:21,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:21,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 04:00:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-02-24 04:00:21,763 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:22,066 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-24 04:00:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 04:00:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-24 04:00:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:22,068 INFO L225 Difference]: With dead ends: 65 [2022-02-24 04:00:22,068 INFO L226 Difference]: Without dead ends: 47 [2022-02-24 04:00:22,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-02-24 04:00:22,069 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:22,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 38 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 04:00:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-24 04:00:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-02-24 04:00:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-24 04:00:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-24 04:00:22,079 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 31 [2022-02-24 04:00:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:22,079 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-24 04:00:22,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-24 04:00:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-24 04:00:22,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:22,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:22,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 04:00:22,081 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash 561539433, now seen corresponding path program 3 times [2022-02-24 04:00:22,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:22,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192870431] [2022-02-24 04:00:22,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:22,118 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:22,174 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 04:00:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:22,422 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:22,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192870431] [2022-02-24 04:00:22,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1192870431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:22,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:22,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 04:00:22,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289198434] [2022-02-24 04:00:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:22,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 04:00:22,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 04:00:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-24 04:00:22,425 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:22,768 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-02-24 04:00:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-24 04:00:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-24 04:00:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:22,769 INFO L225 Difference]: With dead ends: 52 [2022-02-24 04:00:22,769 INFO L226 Difference]: Without dead ends: 38 [2022-02-24 04:00:22,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-02-24 04:00:22,770 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:22,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 04:00:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-24 04:00:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-24 04:00:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 04:00:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-02-24 04:00:22,777 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2022-02-24 04:00:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:22,777 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-02-24 04:00:22,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-24 04:00:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-02-24 04:00:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-24 04:00:22,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:22,779 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:22,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 04:00:22,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 783907799, now seen corresponding path program 1 times [2022-02-24 04:00:22,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:22,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739393612] [2022-02-24 04:00:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:22,815 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 04:00:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:23,098 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:23,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739393612] [2022-02-24 04:00:23,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1739393612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:23,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:23,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-24 04:00:23,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67618718] [2022-02-24 04:00:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:23,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 04:00:23,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 04:00:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-02-24 04:00:23,100 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:23,305 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-02-24 04:00:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 04:00:23,306 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-02-24 04:00:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:23,306 INFO L225 Difference]: With dead ends: 66 [2022-02-24 04:00:23,306 INFO L226 Difference]: Without dead ends: 41 [2022-02-24 04:00:23,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-02-24 04:00:23,307 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:23,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 58 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-02-24 04:00:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-24 04:00:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-02-24 04:00:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 04:00:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-02-24 04:00:23,315 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2022-02-24 04:00:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:23,315 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-02-24 04:00:23,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-02-24 04:00:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-24 04:00:23,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:23,316 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:23,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 04:00:23,317 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2030931829, now seen corresponding path program 2 times [2022-02-24 04:00:23,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:23,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198124113] [2022-02-24 04:00:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:23,353 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:23,384 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 04:00:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:23,739 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:23,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198124113] [2022-02-24 04:00:23,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [198124113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:23,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:23,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-24 04:00:23,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202360145] [2022-02-24 04:00:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:23,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-24 04:00:23,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-24 04:00:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-02-24 04:00:23,741 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:24,089 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-24 04:00:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 04:00:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-02-24 04:00:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:24,091 INFO L225 Difference]: With dead ends: 55 [2022-02-24 04:00:24,091 INFO L226 Difference]: Without dead ends: 43 [2022-02-24 04:00:24,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-02-24 04:00:24,092 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:24,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 71 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-02-24 04:00:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-24 04:00:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-02-24 04:00:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 04:00:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-02-24 04:00:24,099 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2022-02-24 04:00:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:24,099 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-02-24 04:00:24,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-02-24 04:00:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-24 04:00:24,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 04:00:24,100 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 04:00:24,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 04:00:24,100 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 04:00:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 04:00:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2125149075, now seen corresponding path program 3 times [2022-02-24 04:00:24,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 04:00:24,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162868019] [2022-02-24 04:00:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 04:00:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 04:00:24,140 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:24,170 INFO L275 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-24 04:00:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 04:00:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-24 04:00:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 04:00:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 04:00:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 04:00:24,542 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 04:00:24,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162868019] [2022-02-24 04:00:24,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [162868019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 04:00:24,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 04:00:24,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-24 04:00:24,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513462949] [2022-02-24 04:00:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 04:00:24,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-24 04:00:24,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 04:00:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-24 04:00:24,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-02-24 04:00:24,544 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 22 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 04:00:24,871 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-02-24 04:00:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-24 04:00:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-02-24 04:00:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 04:00:24,872 INFO L225 Difference]: With dead ends: 42 [2022-02-24 04:00:24,872 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 04:00:24,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2022-02-24 04:00:24,874 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 04:00:24,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 66 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-02-24 04:00:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 04:00:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 04:00:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-24 04:00:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 04:00:24,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-02-24 04:00:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 04:00:24,875 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 04:00:24,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 04:00:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 04:00:24,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 04:00:24,878 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 04:00:24,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 04:00:24,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 04:00:25,642 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-24 04:00:25,643 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-24 04:00:25,643 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-24 04:00:25,643 INFO L854 garLoopResultBuilder]: At program point L27-1(lines 19 29) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) .cse0) (and (<= 4 correct_version_~w) .cse0 (= correct_version_~i~0 correct_version_~w)))) [2022-02-24 04:00:25,643 INFO L861 garLoopResultBuilder]: At program point correct_versionENTRY(lines 15 32) the Hoare annotation is: true [2022-02-24 04:00:25,643 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 25) the Hoare annotation is: (and (< correct_version_~i~0 correct_version_~w) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w)) [2022-02-24 04:00:25,643 INFO L854 garLoopResultBuilder]: At program point L24-3(lines 24 25) the Hoare annotation is: (and (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w)) [2022-02-24 04:00:25,643 INFO L854 garLoopResultBuilder]: At program point L24-4(lines 22 29) the Hoare annotation is: (and (not (< correct_version_~i~0 correct_version_~w)) (< correct_version_~i~0 (+ 2 correct_version_~w)) (<= 4 correct_version_~w) (= |correct_version_#in~w| correct_version_~w)) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L19(lines 19 29) the Hoare annotation is: (= |correct_version_#in~w| correct_version_~w) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point correct_versionFINAL(lines 15 32) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) (= |correct_version_#res| ~false~0) .cse0) (and (<= correct_version_~i~0 correct_version_~w) (<= correct_version_~w correct_version_~i~0) (= |correct_version_#res| correct_version_~is_divisible~0) (<= 4 correct_version_~w) .cse0))) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point correct_versionEXIT(lines 15 32) the Hoare annotation is: (let ((.cse0 (= |correct_version_#in~w| correct_version_~w))) (or (and (= ~false~0 correct_version_~is_divisible~0) (= |correct_version_#res| ~false~0) .cse0) (and (<= correct_version_~i~0 correct_version_~w) (<= correct_version_~w correct_version_~i~0) (= |correct_version_#res| correct_version_~is_divisible~0) (<= 4 correct_version_~w) .cse0))) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (or (and (= main_~is_divisible1~0 main_~is_divisible2~0) (= ~false~0 main_~is_divisible1~0)) (and (= student_version_~is_divisible~1 main_~is_divisible2~0) (<= student_version_~is_divisible~1 2147483647) (<= 4 student_version_~w) (<= 0 (+ student_version_~is_divisible~1 2147483648)) (= student_version_~i~1 student_version_~w))) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (= ~false~0 main_~is_divisible1~0) [2022-02-24 04:00:25,644 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 53 67) the Hoare annotation is: true [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (= main_~is_divisible1~0 main_~is_divisible2~0) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (or (and (not (< student_version_~i~1 student_version_~w)) (<= 4 student_version_~w) (<= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |main_#t~ret6|)) (and (= |main_#t~ret6| main_~is_divisible1~0) (= ~false~0 main_~is_divisible1~0))) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (and (= main_~is_divisible1~0 main_~is_divisible2~0) (= ~false~0 |main_#t~ret5|)) [2022-02-24 04:00:25,644 INFO L854 garLoopResultBuilder]: At program point L59(lines 59 64) the Hoare annotation is: (= main_~is_divisible1~0 main_~is_divisible2~0) [2022-02-24 04:00:25,645 INFO L861 garLoopResultBuilder]: At program point L59-1(lines 59 64) the Hoare annotation is: true [2022-02-24 04:00:25,645 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 53 67) the Hoare annotation is: true [2022-02-24 04:00:25,645 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 53 67) the Hoare annotation is: true [2022-02-24 04:00:25,645 INFO L854 garLoopResultBuilder]: At program point student_versionFINAL(lines 34 51) the Hoare annotation is: (let ((.cse0 (= ~false~0 |student_version_#res|)) (.cse1 (= |student_version_#in~w| student_version_~w)) (.cse2 (= ~false~0 student_version_~is_divisible~1))) (or (and .cse0 (<= 5 student_version_~w) (< student_version_~i~1 (+ 2 student_version_~w)) .cse1 .cse2 (<= student_version_~w student_version_~i~1)) (and (<= 4 student_version_~w) .cse1 (= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |student_version_#res|)) (and .cse0 (<= |student_version_#in~w| 3) .cse1 .cse2))) [2022-02-24 04:00:25,645 INFO L854 garLoopResultBuilder]: At program point L46-1(lines 38 48) the Hoare annotation is: (let ((.cse1 (= |student_version_#in~w| student_version_~w))) (let ((.cse0 (and (<= 4 student_version_~w) .cse1 (= student_version_~i~1 student_version_~w)))) (and (or .cse0 (= ~false~0 student_version_~is_divisible~1)) (or .cse0 (and (<= |student_version_#in~w| 3) .cse1) (and (<= 5 student_version_~w) (< student_version_~i~1 (+ 2 student_version_~w)) .cse1 (<= student_version_~w student_version_~i~1)))))) [2022-02-24 04:00:25,645 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 44) the Hoare annotation is: (and (= |student_version_#in~w| student_version_~w) (or (and (<= 2 student_version_~i~1) (<= (+ 2 student_version_~i~1) student_version_~w)) (and (<= 0 student_version_~i~1) (<= (+ student_version_~i~1 4) student_version_~w)) (<= 4 student_version_~i~1)) (< student_version_~i~1 student_version_~w)) [2022-02-24 04:00:25,645 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: (let ((.cse1 (<= 4 student_version_~i~1)) (.cse0 (= |student_version_#in~w| student_version_~w))) (or (and (<= 5 student_version_~w) (< student_version_~i~1 (+ 2 student_version_~w)) .cse0 .cse1) (and (<= student_version_~i~1 student_version_~w) .cse0 .cse1) (and (<= 0 student_version_~i~1) (<= (+ student_version_~i~1 4) student_version_~w) .cse0) (and (<= 2 student_version_~i~1) .cse0 (<= (+ 2 student_version_~i~1) student_version_~w)))) [2022-02-24 04:00:25,645 INFO L861 garLoopResultBuilder]: At program point student_versionENTRY(lines 34 51) the Hoare annotation is: true [2022-02-24 04:00:25,645 INFO L854 garLoopResultBuilder]: At program point L43-4(lines 41 48) the Hoare annotation is: (and (not (< student_version_~i~1 student_version_~w)) (or (<= 5 student_version_~w) (and (<= 4 student_version_~w) (<= student_version_~i~1 student_version_~w))) (< student_version_~i~1 (+ 2 student_version_~w)) (= |student_version_#in~w| student_version_~w)) [2022-02-24 04:00:25,646 INFO L854 garLoopResultBuilder]: At program point L38(lines 38 48) the Hoare annotation is: (= |student_version_#in~w| student_version_~w) [2022-02-24 04:00:25,646 INFO L854 garLoopResultBuilder]: At program point student_versionEXIT(lines 34 51) the Hoare annotation is: (let ((.cse0 (= ~false~0 |student_version_#res|)) (.cse1 (= |student_version_#in~w| student_version_~w)) (.cse2 (= ~false~0 student_version_~is_divisible~1))) (or (and .cse0 (<= 5 student_version_~w) (< student_version_~i~1 (+ 2 student_version_~w)) .cse1 .cse2 (<= student_version_~w student_version_~i~1)) (and (<= 4 student_version_~w) .cse1 (= student_version_~i~1 student_version_~w) (= student_version_~is_divisible~1 |student_version_#res|)) (and .cse0 (<= |student_version_#in~w| 3) .cse1 .cse2))) [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-02-24 04:00:25,646 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (let ((.cse0 (not (= __VERIFIER_assert_~cond 0)))) (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) .cse0) (or (= |__VERIFIER_assert_#in~cond| 0) .cse0))) [2022-02-24 04:00:25,647 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (and (or (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (= __VERIFIER_assert_~cond 0) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) (not (<= student_version_~i~1 student_version_~w)) (< student_version_~i~1 student_version_~w)) (= |__VERIFIER_assert_#in~cond| 0)) [2022-02-24 04:00:25,647 INFO L854 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (not (= student_version_~i~1 student_version_~w)) (and (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 0 (+ student_version_~is_divisible~1 2147483648)))) (or .cse0 (not (= __VERIFIER_assert_~cond 0))))) [2022-02-24 04:00:25,647 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (let ((.cse0 (not (= __VERIFIER_assert_~cond 0)))) (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648))) .cse0) (or (= |__VERIFIER_assert_#in~cond| 0) .cse0))) [2022-02-24 04:00:25,648 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (or (not (= student_version_~i~1 student_version_~w)) (not (<= student_version_~is_divisible~1 2147483647)) (not (<= 4 student_version_~w)) (not (<= 0 (+ student_version_~is_divisible~1 2147483648)))) (= |__VERIFIER_assert_#in~cond| 0)) [2022-02-24 04:00:25,650 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-02-24 04:00:25,651 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 04:00:25,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 04:00:25 BoogieIcfgContainer [2022-02-24 04:00:25,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 04:00:25,686 INFO L158 Benchmark]: Toolchain (without parser) took 7803.45ms. Allocated memory was 187.7MB in the beginning and 296.7MB in the end (delta: 109.1MB). Free memory was 133.0MB in the beginning and 129.5MB in the end (delta: 3.5MB). Peak memory consumption was 114.1MB. Max. memory is 8.0GB. [2022-02-24 04:00:25,686 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 04:00:25,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.86ms. Allocated memory is still 187.7MB. Free memory was 132.9MB in the beginning and 158.4MB in the end (delta: -25.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-02-24 04:00:25,687 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 187.7MB. Free memory was 158.4MB in the beginning and 157.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-24 04:00:25,687 INFO L158 Benchmark]: RCFGBuilder took 269.42ms. Allocated memory is still 187.7MB. Free memory was 156.8MB in the beginning and 145.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-24 04:00:25,687 INFO L158 Benchmark]: TraceAbstraction took 7171.16ms. Allocated memory was 187.7MB in the beginning and 296.7MB in the end (delta: 109.1MB). Free memory was 145.6MB in the beginning and 129.5MB in the end (delta: 16.1MB). Peak memory consumption was 126.2MB. Max. memory is 8.0GB. [2022-02-24 04:00:25,688 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.86ms. Allocated memory is still 187.7MB. Free memory was 132.9MB in the beginning and 158.4MB in the end (delta: -25.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 187.7MB. Free memory was 158.4MB in the beginning and 157.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 269.42ms. Allocated memory is still 187.7MB. Free memory was 156.8MB in the beginning and 145.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7171.16ms. Allocated memory was 187.7MB in the beginning and 296.7MB in the end (delta: 109.1MB). Free memory was 145.6MB in the beginning and 129.5MB in the end (delta: 16.1MB). Peak memory consumption was 126.2MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 108 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1839 IncrementalHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 233 mSDtfsCounter, 1839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 153 PreInvPairs, 291 NumberOfFragments, 609 HoareAnnotationTreeSize, 153 FomulaSimplifications, 211 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 1182 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((5 <= w && i < 2 + w) && \old(w) == w) && 4 <= i) || ((i <= w && \old(w) == w) && 4 <= i)) || ((0 <= i && i + 4 <= w) && \old(w) == w)) || ((2 <= i && \old(w) == w) && 2 + i <= w) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (i < 2 + w && 4 <= w) && \old(w) == w - ProcedureContractResult [Line: 15]: Procedure Contract for correct_version Derived contract for procedure correct_version: ((false == is_divisible && \result == false) && \old(w) == w) || ((((i <= w && w <= i) && \result == is_divisible) && 4 <= w) && \old(w) == w) - ProcedureContractResult [Line: 34]: Procedure Contract for student_version Derived contract for procedure student_version: ((((((false == \result && 5 <= w) && i < 2 + w) && \old(w) == w) && false == is_divisible) && w <= i) || (((4 <= w && \old(w) == w) && i == w) && is_divisible == \result)) || (((false == \result && \old(w) <= 3) && \old(w) == w) && false == is_divisible) - ProcedureContractResult [Line: 53]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((((!(i == w) || !(is_divisible <= 2147483647)) || !(4 <= w)) || !(0 <= is_divisible + 2147483648)) || !(cond == 0)) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-02-24 04:00:25,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...