/usr/bin/java -ea -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/nla-digbench-scaling/dijkstra-u_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:12:11,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:12:11,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:12:11,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:12:11,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:12:11,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:12:11,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:12:11,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:12:11,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:12:11,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:12:11,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:12:11,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:12:11,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:12:11,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:12:11,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:12:11,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:12:11,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:12:11,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:12:11,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:12:11,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:12:11,733 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:12:11,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:12:11,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:12:11,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:12:11,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:12:11,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:12:11,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:12:11,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:12:11,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:12:11,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:12:11,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:12:11,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:12:11,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:12:11,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:12:11,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:12:11,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:12:11,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:12:11,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:12:11,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:12:11,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:12:11,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:12:11,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:12:11,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:12:11,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:12:11,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:12:11,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:12:11,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:12:11,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:12:11,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:12:11,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:12:11,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:12:11,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:12:11,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:12:11,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:12:11,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:12:11,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:12:11,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:12:11,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:12:11,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:12:11,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:12:11,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:12:11,758 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:12:11,758 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:12:11,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:12:11,758 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:12:11,758 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-04-15 14:12:11,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:12:11,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:12:11,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:12:11,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:12:11,944 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:12:11,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-15 14:12:11,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6eb2784b/d386dc450afd4deea429b1c570316972/FLAG63f7eaf26 [2022-04-15 14:12:12,373 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:12:12,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-15 14:12:12,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6eb2784b/d386dc450afd4deea429b1c570316972/FLAG63f7eaf26 [2022-04-15 14:12:12,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6eb2784b/d386dc450afd4deea429b1c570316972 [2022-04-15 14:12:12,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:12:12,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:12:12,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:12:12,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:12:12,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:12:12,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f8fe5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12, skipping insertion in model container [2022-04-15 14:12:12,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:12:12,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:12:12,631 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_valuebound10.c[525,538] [2022-04-15 14:12:12,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:12:12,674 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:12:12,684 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_valuebound10.c[525,538] [2022-04-15 14:12:12,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:12:12,709 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:12:12,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12 WrapperNode [2022-04-15 14:12:12,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:12:12,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:12:12,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:12:12,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:12:12,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:12:12,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:12:12,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:12:12,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:12:12,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (1/1) ... [2022-04-15 14:12:12,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:12:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:12:12,772 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-04-15 14:12:12,779 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-04-15 14:12:12,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:12:12,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:12:12,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:12:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:12:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:12:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:12:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:12:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:12:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:12:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:12:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:12:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:12:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:12:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:12:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:12:12,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:12:12,862 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:12:13,050 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:12:13,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:12:13,056 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:12:13,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:12:13 BoogieIcfgContainer [2022-04-15 14:12:13,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:12:13,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:12:13,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:12:13,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:12:13,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:12:12" (1/3) ... [2022-04-15 14:12:13,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3fe21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:12:13, skipping insertion in model container [2022-04-15 14:12:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:12:12" (2/3) ... [2022-04-15 14:12:13,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3fe21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:12:13, skipping insertion in model container [2022-04-15 14:12:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:12:13" (3/3) ... [2022-04-15 14:12:13,063 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.c [2022-04-15 14:12:13,067 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:12:13,067 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:12:13,123 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:12:13,129 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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 [2022-04-15 14:12:13,129 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:12:13,146 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-04-15 14:12:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:12:13,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:12:13,156 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:12:13,156 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:12:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:12:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-15 14:12:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:13,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486442280] [2022-04-15 14:12:13,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:12:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-15 14:12:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:12:13,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658426006] [2022-04-15 14:12:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:12:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:12:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:12:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:13,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-15 14:12:13,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:12:13,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:12:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:12:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:13,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:12:13,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:12:13,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:12:13,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:12:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:12:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:13,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:12:13,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:12:13,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:12:13,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:12:13,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:12:13,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-15 14:12:13,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:12:13,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:12:13,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-15 14:12:13,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-15 14:12:13,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 10 then 1 else 0)); {41#true} is VALID [2022-04-15 14:12:13,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:12:13,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:12:13,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:12:13,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:12:13,462 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-15 14:12:13,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:12:13,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:12:13,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:12:13,464 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:12:13,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-15 14:12:13,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:12:13,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:12:13,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-15 14:12:13,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 14:12:13,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 14:12:13,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 14:12:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:12:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:12:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658426006] [2022-04-15 14:12:13,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658426006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:13,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:12:13,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:12:13,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486442280] [2022-04-15 14:12:13,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486442280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:13,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:13,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:12:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058844394] [2022-04-15 14:12:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:12:13,476 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-04-15 14:12:13,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:12:13,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 14:12:13,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:13,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:12:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:12:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:12:13,548 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-04-15 14:12:20,561 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-04-15 14:12:24,980 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-04-15 14:12:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:25,097 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-15 14:12:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:12:25,098 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-04-15 14:12:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:12:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 14:12:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:12:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 14:12:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:12:25,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-15 14:12:25,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:25,285 INFO L225 Difference]: With dead ends: 69 [2022-04-15 14:12:25,286 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 14:12:25,288 INFO L912 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-04-15 14:12:25,291 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:12:25,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 14:12:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 14:12:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 14:12:25,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:12:25,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second 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-04-15 14:12:25,331 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second 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-04-15 14:12:25,332 INFO L87 Difference]: Start difference. First operand 33 states. Second 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-04-15 14:12:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:25,337 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:12:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:12:25,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:12:25,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:12:25,338 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 33 states. [2022-04-15 14:12:25,339 INFO L87 Difference]: Start difference. First 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) Second operand 33 states. [2022-04-15 14:12:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:25,342 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:12:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:12:25,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:12:25,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:12:25,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:12:25,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:12:25,344 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-04-15 14:12:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-15 14:12:25,348 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-15 14:12:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:12:25,348 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-15 14:12:25,348 INFO L479 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-04-15 14:12:25,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-15 14:12:25,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:12:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 14:12:25,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:12:25,412 INFO L499 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-04-15 14:12:25,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:12:25,413 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:12:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:12:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-15 14:12:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:25,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26255984] [2022-04-15 14:12:25,414 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:12:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-15 14:12:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:12:25,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868191785] [2022-04-15 14:12:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:12:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:12:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:12:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:25,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-15 14:12:25,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:12:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:12:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:25,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:12:25,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:12:25,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:12:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:12:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:25,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:12:25,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:12:25,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:12:25,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:12:25,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-15 14:12:25,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:12:25,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-15 14:12:25,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-15 14:12:25,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 10 then 1 else 0)); {327#true} is VALID [2022-04-15 14:12:25,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:12:25,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:12:25,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:12:25,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {327#true} is VALID [2022-04-15 14:12:25,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:12:25,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:12:25,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:12:25,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:12:25,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 14:12:25,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 14:12:25,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:12:25,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !false; {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:12:25,696 INFO L272 TraceCheckUtils]: 20: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:12:25,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:12:25,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-15 14:12:25,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 14:12:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:12:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:12:25,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868191785] [2022-04-15 14:12:25,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868191785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:25,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:25,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:12:25,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:12:25,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26255984] [2022-04-15 14:12:25,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26255984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:25,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:25,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:12:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552122749] [2022-04-15 14:12:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:12:25,700 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-04-15 14:12:25,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:12:25,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 14:12:25,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:25,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:12:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:12:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:12:25,720 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-04-15 14:12:33,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:12:38,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 14:12:40,532 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-04-15 14:12:42,534 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-04-15 14:12:47,756 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-04-15 14:12:49,758 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-04-15 14:12:51,803 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-04-15 14:12:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:52,242 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-15 14:12:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:12:52,242 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-04-15 14:12:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:12:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 14:12:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-15 14:12:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 14:12:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-15 14:12:52,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-15 14:12:52,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:52,463 INFO L225 Difference]: With dead ends: 66 [2022-04-15 14:12:52,464 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 14:12:52,464 INFO L912 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-04-15 14:12:52,465 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 41 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:12:52,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 58 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 192 Invalid, 5 Unknown, 0 Unchecked, 17.1s Time] [2022-04-15 14:12:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 14:12:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 14:12:52,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:12:52,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:12:52,485 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:12:52,486 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:12:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:52,490 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-04-15 14:12:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-04-15 14:12:52,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:12:52,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:12:52,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:12:52,492 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:12:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:12:52,495 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-04-15 14:12:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-04-15 14:12:52,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:12:52,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:12:52,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:12:52,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:12:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:12:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-15 14:12:52,500 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 24 [2022-04-15 14:12:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:12:52,500 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-15 14:12:52,501 INFO L479 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-04-15 14:12:52,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-15 14:12:52,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 14:12:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:12:52,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:12:52,774 INFO L499 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-04-15 14:12:52,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 14:12:52,774 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:12:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:12:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-15 14:12:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:52,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [71068783] [2022-04-15 14:12:52,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:12:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-15 14:12:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:12:52,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072060724] [2022-04-15 14:12:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:12:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:12:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:12:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:53,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-15 14:12:53,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #103#return; {679#true} is VALID [2022-04-15 14:12:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:12:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:53,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2022-04-15 14:12:53,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2022-04-15 14:12:53,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #81#return; {679#true} is VALID [2022-04-15 14:12:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:12:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:12:53,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2022-04-15 14:12:53,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2022-04-15 14:12:53,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #83#return; {679#true} is VALID [2022-04-15 14:12:53,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:12:53,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-15 14:12:53,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #103#return; {679#true} is VALID [2022-04-15 14:12:53,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret5 := main(); {679#true} is VALID [2022-04-15 14:12:53,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {679#true} is VALID [2022-04-15 14:12:53,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {679#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 10 then 1 else 0)); {679#true} is VALID [2022-04-15 14:12:53,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2022-04-15 14:12:53,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2022-04-15 14:12:53,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {679#true} {679#true} #81#return; {679#true} is VALID [2022-04-15 14:12:53,029 INFO L272 TraceCheckUtils]: 11: Hoare triple {679#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {679#true} is VALID [2022-04-15 14:12:53,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2022-04-15 14:12:53,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2022-04-15 14:12:53,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-15 14:12:53,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {679#true} {679#true} #83#return; {679#true} is VALID [2022-04-15 14:12:53,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {679#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:12:53,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:12:53,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:12:53,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:12:53,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {692#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {693#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:12:53,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {693#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {693#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:12:53,036 INFO L272 TraceCheckUtils]: 22: Hoare triple {693#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {694#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:12:53,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {694#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {695#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:12:53,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {695#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {680#false} is VALID [2022-04-15 14:12:53,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-15 14:12:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:12:53,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:12:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072060724] [2022-04-15 14:12:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072060724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:53,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:53,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:12:53,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:12:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [71068783] [2022-04-15 14:12:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [71068783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:12:53,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:12:53,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:12:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175977906] [2022-04-15 14:12:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:12:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:12:53,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:12:53,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:12:53,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:12:53,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:12:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:12:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:12:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:12:53,064 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:12:58,754 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-04-15 14:13:04,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:13:09,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:13:11,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:13:14,308 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-04-15 14:13:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:16,957 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-04-15 14:13:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:13:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:13:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:13:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-15 14:13:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:13:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-15 14:13:16,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-15 14:13:17,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:17,378 INFO L225 Difference]: With dead ends: 76 [2022-04-15 14:13:17,378 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 14:13:17,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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-04-15 14:13:17,380 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 87 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:17,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 48 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 223 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2022-04-15 14:13:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 14:13:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-15 14:13:17,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:17,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:13:17,408 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:13:17,409 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:13:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:17,413 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-15 14:13:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-15 14:13:17,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:17,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:17,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-15 14:13:17,416 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-15 14:13:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:17,420 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-15 14:13:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-15 14:13:17,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:17,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:17,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:17,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:13:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-15 14:13:17,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-15 14:13:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:17,425 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-15 14:13:17,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-04-15 14:13:17,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-15 14:13:17,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-15 14:13:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:13:17,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:17,826 INFO L499 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-04-15 14:13:17,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 14:13:17,826 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:17,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-15 14:13:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153562917] [2022-04-15 14:13:17,827 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:13:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-15 14:13:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307221773] [2022-04-15 14:13:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:17,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580021605] [2022-04-15 14:13:17,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:17,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:17,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:13:17,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 14:13:17,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:13:17,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:13:17,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:13:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:13:17,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:13:18,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1127#true} is VALID [2022-04-15 14:13:18,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1127#true} is VALID [2022-04-15 14:13:18,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1127#true} assume true; {1127#true} is VALID [2022-04-15 14:13:18,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1127#true} {1127#true} #103#return; {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1127#true} call #t~ret5 := main(); {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1127#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {1127#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 10 then 1 else 0)); {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1127#true} ~cond := #in~cond; {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1127#true} assume !(0 == ~cond); {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#true} assume true; {1127#true} is VALID [2022-04-15 14:13:18,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1127#true} {1127#true} #81#return; {1127#true} is VALID [2022-04-15 14:13:18,115 INFO L272 TraceCheckUtils]: 11: Hoare triple {1127#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1127#true} is VALID [2022-04-15 14:13:18,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {1127#true} ~cond := #in~cond; {1127#true} is VALID [2022-04-15 14:13:18,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {1127#true} assume !(0 == ~cond); {1127#true} is VALID [2022-04-15 14:13:18,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1127#true} assume true; {1127#true} is VALID [2022-04-15 14:13:18,115 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1127#true} {1127#true} #83#return; {1127#true} is VALID [2022-04-15 14:13:18,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1127#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,117 INFO L272 TraceCheckUtils]: 20: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1127#true} is VALID [2022-04-15 14:13:18,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {1127#true} ~cond := #in~cond; {1127#true} is VALID [2022-04-15 14:13:18,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {1127#true} assume !(0 == ~cond); {1127#true} is VALID [2022-04-15 14:13:18,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {1127#true} assume true; {1127#true} is VALID [2022-04-15 14:13:18,119 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1127#true} {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,119 INFO L272 TraceCheckUtils]: 25: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1127#true} is VALID [2022-04-15 14:13:18,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {1127#true} ~cond := #in~cond; {1127#true} is VALID [2022-04-15 14:13:18,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {1127#true} assume !(0 == ~cond); {1127#true} is VALID [2022-04-15 14:13:18,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {1127#true} assume true; {1127#true} is VALID [2022-04-15 14:13:18,120 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1127#true} {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:13:18,121 INFO L272 TraceCheckUtils]: 30: Hoare triple {1180#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:13:18,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:18,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1128#false} is VALID [2022-04-15 14:13:18,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2022-04-15 14:13:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 14:13:18,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:13:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:13:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307221773] [2022-04-15 14:13:18,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:13:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580021605] [2022-04-15 14:13:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580021605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:18,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:18,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:18,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:13:18,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153562917] [2022-04-15 14:13:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153562917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:18,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916281503] [2022-04-15 14:13:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:13:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:13:18,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:13:18,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:18,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:18,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:13:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:13:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:13:18,152 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:24,851 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-15 14:13:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:13:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:13:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:13:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:13:24,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 14:13:24,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:24,924 INFO L225 Difference]: With dead ends: 74 [2022-04-15 14:13:24,924 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 14:13:24,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:13:24,927 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:24,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 14:13:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 14:13:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 14:13:24,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:24,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:13:24,949 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:13:24,950 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:13:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:24,953 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 14:13:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 14:13:24,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:24,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:24,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-15 14:13:24,955 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-15 14:13:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:24,957 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 14:13:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 14:13:24,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:24,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:24,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:24,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:13:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-15 14:13:24,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-15 14:13:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:24,961 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-15 14:13:24,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:24,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-15 14:13:25,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-15 14:13:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 14:13:25,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:25,176 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 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-04-15 14:13:25,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 14:13:25,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:25,377 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-15 14:13:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:25,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995680995] [2022-04-15 14:13:25,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:13:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-15 14:13:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:25,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279517645] [2022-04-15 14:13:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:25,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:25,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:25,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227492770] [2022-04-15 14:13:25,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:25,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:25,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:25,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:13:25,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 14:13:25,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:13:25,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:13:25,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:13:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:13:25,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:13:25,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2022-04-15 14:13:25,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1587#true} is VALID [2022-04-15 14:13:25,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:13:25,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1587#true} {1587#true} #103#return; {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1587#true} call #t~ret5 := main(); {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1587#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {1587#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 10 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:13:25,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1587#true} {1587#true} #81#return; {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L272 TraceCheckUtils]: 11: Hoare triple {1587#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:13:25,703 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1587#true} {1587#true} #83#return; {1587#true} is VALID [2022-04-15 14:13:25,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1587#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,707 INFO L272 TraceCheckUtils]: 22: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:13:25,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:13:25,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:13:25,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:13:25,708 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1587#true} {1640#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,708 INFO L272 TraceCheckUtils]: 27: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:13:25,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:13:25,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:13:25,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:13:25,716 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1587#true} {1640#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:13:25,717 INFO L272 TraceCheckUtils]: 32: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1689#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:13:25,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {1689#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1693#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:13:25,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {1693#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1588#false} is VALID [2022-04-15 14:13:25,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2022-04-15 14:13:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 14:13:25,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:13:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:13:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279517645] [2022-04-15 14:13:25,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:13:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227492770] [2022-04-15 14:13:25,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227492770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:25,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:25,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:25,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:13:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995680995] [2022-04-15 14:13:25,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995680995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:13:25,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:13:25,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:13:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443403869] [2022-04-15 14:13:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:13:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:13:25,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:13:25,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:25,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:25,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:13:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:13:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:13:25,749 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:31,098 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-04-15 14:13:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:32,628 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-15 14:13:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:13:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:13:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:13:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 14:13:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 14:13:32,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 14:13:32,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:32,698 INFO L225 Difference]: With dead ends: 68 [2022-04-15 14:13:32,698 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 14:13:32,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:13:32,699 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:13:32,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 14:13:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 14:13:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 14:13:32,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:13:32,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:13:32,732 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:13:32,732 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:13:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:32,736 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 14:13:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 14:13:32,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:32,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:32,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-15 14:13:32,737 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-15 14:13:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:13:32,740 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 14:13:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 14:13:32,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:13:32,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:13:32,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:13:32,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:13:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 14:13:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-15 14:13:32,744 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-15 14:13:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:13:32,744 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-15 14:13:32,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:13:32,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-15 14:13:33,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:13:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 14:13:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 14:13:33,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:13:33,039 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:13:33,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 14:13:33,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:33,243 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:13:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:13:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-15 14:13:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:13:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185344955] [2022-04-15 14:13:33,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:13:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-15 14:13:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:13:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421543602] [2022-04-15 14:13:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:13:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:13:33,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:13:33,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262984081] [2022-04-15 14:13:33,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:13:33,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:13:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:13:33,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:13:33,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process