/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 02:27:12,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 02:27:12,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 02:27:12,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 02:27:12,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 02:27:12,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 02:27:12,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 02:27:12,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 02:27:12,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 02:27:12,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 02:27:12,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 02:27:12,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 02:27:12,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 02:27:12,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 02:27:12,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 02:27:12,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 02:27:12,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 02:27:12,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 02:27:12,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 02:27:12,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 02:27:12,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 02:27:12,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 02:27:12,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 02:27:12,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 02:27:12,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 02:27:12,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 02:27:12,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 02:27:12,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 02:27:12,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 02:27:12,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 02:27:12,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 02:27:12,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 02:27:12,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 02:27:12,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 02:27:12,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 02:27:12,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 02:27:12,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 02:27:12,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 02:27:12,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 02:27:12,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 02:27:12,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 02:27:12,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 02:27:12,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 02:27:12,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 02:27:12,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 02:27:12,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 02:27:12,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 02:27:12,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 02:27:12,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 02:27:12,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 02:27:12,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:27:12,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 02:27:12,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 02:27:12,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 02:27:12,790 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 02:27:12,790 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-15 02:27:13,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 02:27:13,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 02:27:13,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 02:27:13,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 02:27:13,064 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 02:27:13,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-02-15 02:27:13,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f114675/f01365a4b74f4fa6841d408b8292e91e/FLAGe5c771c72 [2022-02-15 02:27:13,505 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 02:27:13,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-02-15 02:27:13,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f114675/f01365a4b74f4fa6841d408b8292e91e/FLAGe5c771c72 [2022-02-15 02:27:13,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f114675/f01365a4b74f4fa6841d408b8292e91e [2022-02-15 02:27:13,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 02:27:13,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 02:27:13,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 02:27:13,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 02:27:13,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 02:27:13,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67142754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13, skipping insertion in model container [2022-02-15 02:27:13,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 02:27:13,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 02:27:13,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2022-02-15 02:27:13,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:27:13,779 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 02:27:13,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2022-02-15 02:27:13,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:27:13,867 INFO L208 MainTranslator]: Completed translation [2022-02-15 02:27:13,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13 WrapperNode [2022-02-15 02:27:13,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 02:27:13,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 02:27:13,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 02:27:13,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 02:27:13,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 02:27:13,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 02:27:13,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 02:27:13,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 02:27:13,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (1/1) ... [2022-02-15 02:27:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:27:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 02:27:13,944 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-15 02:27:13,971 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-15 02:27:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 02:27:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 02:27:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 02:27:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 02:27:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 02:27:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 02:27:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 02:27:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 02:27:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 02:27:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 02:27:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 02:27:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 02:27:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 02:27:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 02:27:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 02:27:14,046 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 02:27:14,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 02:27:14,236 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 02:27:14,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 02:27:14,242 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-15 02:27:14,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:27:14 BoogieIcfgContainer [2022-02-15 02:27:14,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 02:27:14,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 02:27:14,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 02:27:14,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 02:27:14,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:27:13" (1/3) ... [2022-02-15 02:27:14,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1cb200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:27:14, skipping insertion in model container [2022-02-15 02:27:14,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:13" (2/3) ... [2022-02-15 02:27:14,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1cb200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:27:14, skipping insertion in model container [2022-02-15 02:27:14,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:27:14" (3/3) ... [2022-02-15 02:27:14,250 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2022-02-15 02:27:14,254 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 02:27:14,254 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 02:27:14,314 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 02:27:14,319 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=JORDAN [2022-02-15 02:27:14,319 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 02:27:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-15 02:27:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 02:27:14,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:14,337 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:14,337 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-02-15 02:27:14,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:14,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124218814] [2022-02-15 02:27:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:14,393 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:14,535 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:14,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124218814] [2022-02-15 02:27:14,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2124218814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:14,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:14,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 02:27:14,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600703720] [2022-02-15 02:27:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:14,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 02:27:14,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 02:27:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 02:27:14,566 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 02:27:16,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:18,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:19,009 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-02-15 02:27:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 02:27:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 23 [2022-02-15 02:27:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:19,017 INFO L225 Difference]: With dead ends: 69 [2022-02-15 02:27:19,018 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 02:27:19,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 02:27:19,026 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:19,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-02-15 02:27:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 02:27:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-15 02:27:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-15 02:27:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-02-15 02:27:19,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-02-15 02:27:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:19,080 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-15 02:27:19,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 02:27:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-15 02:27:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 02:27:19,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:19,082 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:19,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 02:27:19,083 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-02-15 02:27:19,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:19,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [313987210] [2022-02-15 02:27:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:19,092 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:19,395 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:19,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [313987210] [2022-02-15 02:27:19,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [313987210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:19,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:19,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 02:27:19,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675530233] [2022-02-15 02:27:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:19,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 02:27:19,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 02:27:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 02:27:19,400 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:23,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:27:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:25,460 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-02-15 02:27:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 02:27:25,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-15 02:27:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:25,462 INFO L225 Difference]: With dead ends: 68 [2022-02-15 02:27:25,463 INFO L226 Difference]: Without dead ends: 48 [2022-02-15 02:27:25,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:27:25,465 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:25,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-02-15 02:27:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-15 02:27:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-15 02:27:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-15 02:27:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-02-15 02:27:25,491 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-02-15 02:27:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:25,491 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-02-15 02:27:25,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-02-15 02:27:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 02:27:25,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:25,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:25,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 02:27:25,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-02-15 02:27:25,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:25,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122861343] [2022-02-15 02:27:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:25,500 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:25,732 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:25,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122861343] [2022-02-15 02:27:25,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1122861343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:25,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:25,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 02:27:25,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233805200] [2022-02-15 02:27:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:25,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 02:27:25,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 02:27:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-15 02:27:25,734 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:29,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:31,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:33,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:36,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:40,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:27:42,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:44,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:46,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:27:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:47,486 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2022-02-15 02:27:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:27:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-15 02:27:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:47,489 INFO L225 Difference]: With dead ends: 83 [2022-02-15 02:27:47,489 INFO L226 Difference]: Without dead ends: 77 [2022-02-15 02:27:47,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-15 02:27:47,491 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 94 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:47,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 58 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 280 Invalid, 8 Unknown, 0 Unchecked, 21.6s Time] [2022-02-15 02:27:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-15 02:27:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2022-02-15 02:27:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 38 states have internal predecessors, (43), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-15 02:27:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2022-02-15 02:27:47,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 26 [2022-02-15 02:27:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:47,511 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2022-02-15 02:27:47,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-02-15 02:27:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 02:27:47,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:47,512 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:47,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 02:27:47,513 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash -148039962, now seen corresponding path program 2 times [2022-02-15 02:27:47,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:47,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911015618] [2022-02-15 02:27:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:47,515 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:47,728 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:47,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911015618] [2022-02-15 02:27:47,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1911015618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:47,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:47,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:27:47,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053015579] [2022-02-15 02:27:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:47,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:27:47,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:27:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:27:47,730 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:52,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:54,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:56,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:00,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:03,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:05,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:07,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:10,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:12,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:16,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:28:16,729 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2022-02-15 02:28:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 02:28:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-15 02:28:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:28:16,732 INFO L225 Difference]: With dead ends: 106 [2022-02-15 02:28:16,733 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 02:28:16,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-15 02:28:16,734 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 104 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2022-02-15 02:28:16,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 87 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 434 Invalid, 10 Unknown, 0 Unchecked, 28.7s Time] [2022-02-15 02:28:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 02:28:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-02-15 02:28:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 40 states have call successors, (40), 9 states have call predecessors, (40), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-15 02:28:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2022-02-15 02:28:16,761 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 28 [2022-02-15 02:28:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:28:16,761 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2022-02-15 02:28:16,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2022-02-15 02:28:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 02:28:16,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:28:16,762 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:28:16,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 02:28:16,763 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:28:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:28:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -79413119, now seen corresponding path program 3 times [2022-02-15 02:28:16,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:28:16,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663537962] [2022-02-15 02:28:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:28:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:28:16,765 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:28:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:28:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:28:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:17,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:28:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:28:17,031 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:28:17,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663537962] [2022-02-15 02:28:17,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [663537962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:28:17,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:28:17,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 02:28:17,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154726255] [2022-02-15 02:28:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:28:17,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 02:28:17,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:28:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 02:28:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-15 02:28:17,032 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:21,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:26,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:28,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:30,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:32,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:34,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:36,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:39,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:41,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:43,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-15 02:28:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:28:43,796 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2022-02-15 02:28:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 02:28:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-02-15 02:28:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:28:43,799 INFO L225 Difference]: With dead ends: 138 [2022-02-15 02:28:43,799 INFO L226 Difference]: Without dead ends: 126 [2022-02-15 02:28:43,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-02-15 02:28:43,800 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 148 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-02-15 02:28:43,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 484 Invalid, 10 Unknown, 0 Unchecked, 26.5s Time] [2022-02-15 02:28:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-15 02:28:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2022-02-15 02:28:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 50 states have call successors, (50), 12 states have call predecessors, (50), 11 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2022-02-15 02:28:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2022-02-15 02:28:43,830 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 30 [2022-02-15 02:28:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:28:43,830 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2022-02-15 02:28:43,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2022-02-15 02:28:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-15 02:28:43,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:28:43,832 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:28:43,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 02:28:43,832 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:28:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:28:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-02-15 02:28:43,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:28:43,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718833902] [2022-02-15 02:28:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:28:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:28:43,834 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:28:43,859 WARN L132 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2022-02-15 02:28:43,859 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2022-02-15 02:28:43,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 02:28:43,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 02:28:43,876 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-15 02:28:43,878 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 02:28:43,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 02:28:43 BoogieIcfgContainer [2022-02-15 02:28:43,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 02:28:43,891 INFO L158 Benchmark]: Toolchain (without parser) took 90366.83ms. Allocated memory was 170.9MB in the beginning and 231.7MB in the end (delta: 60.8MB). Free memory was 114.4MB in the beginning and 79.2MB in the end (delta: 35.2MB). Peak memory consumption was 96.4MB. Max. memory is 8.0GB. [2022-02-15 02:28:43,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 02:28:43,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.79ms. Allocated memory was 170.9MB in the beginning and 231.7MB in the end (delta: 60.8MB). Free memory was 114.2MB in the beginning and 202.8MB in the end (delta: -88.6MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2022-02-15 02:28:43,892 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 231.7MB. Free memory was 202.8MB in the beginning and 201.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 02:28:43,892 INFO L158 Benchmark]: RCFGBuilder took 338.07ms. Allocated memory is still 231.7MB. Free memory was 201.3MB in the beginning and 188.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-15 02:28:43,892 INFO L158 Benchmark]: TraceAbstraction took 89645.55ms. Allocated memory is still 231.7MB. Free memory was 188.2MB in the beginning and 79.2MB in the end (delta: 108.9MB). Peak memory consumption was 109.4MB. Max. memory is 8.0GB. [2022-02-15 02:28:43,894 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.13ms. Allocated memory is still 170.9MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.79ms. Allocated memory was 170.9MB in the beginning and 231.7MB in the end (delta: 60.8MB). Free memory was 114.2MB in the beginning and 202.8MB in the end (delta: -88.6MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 231.7MB. Free memory was 202.8MB in the beginning and 201.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 338.07ms. Allocated memory is still 231.7MB. Free memory was 201.3MB in the beginning and 188.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 89645.55ms. Allocated memory is still 231.7MB. Free memory was 188.2MB in the beginning and 79.2MB in the end (delta: 108.9MB). Peak memory consumption was 109.4MB. 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 - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L20] unsigned int n, p, q, r, h; [L22] n = __VERIFIER_nondet_uint() [L23] CALL assume_abort_if_not(n>=0 && n<=2) [L9] COND FALSE !(!cond) [L23] RET assume_abort_if_not(n>=0 && n<=2) [L24] CALL assume_abort_if_not(n < 4294967295 / 4) [L9] COND FALSE !(!cond) [L24] RET assume_abort_if_not(n < 4294967295 / 4) [L26] p = 0 [L27] q = 1 [L28] r = n [L29] h = 0 [L30] COND TRUE 1 [L31] COND TRUE !(q <= n) [L38] COND TRUE 1 [L39] CALL __VERIFIER_assert(r < 2 * p + q) [L12] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(r < 2 * p + q) [L40] CALL __VERIFIER_assert(p*p + r*q == n*q) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(p*p + r*q == n*q) [L41] CALL __VERIFIER_assert(h * h * h - 12 * h * n * q + 16 * n * p * q - h * q * q - 4 * p * q * q + 12 * h * q * r - 16 * p * q * r == 0) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 89.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 88.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 87.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 85.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1421 IncrementalHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 203 mSDtfsCounter, 1421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-15 02:28:43,936 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...