/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/dijkstra-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:18:31,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:18:31,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:18:31,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:18:31,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:18:31,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:18:31,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:18:31,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:18:31,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:18:31,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:18:31,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:18:31,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:18:31,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:18:31,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:18:31,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:18:31,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:18:31,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:18:31,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:18:31,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:18:31,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:18:31,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:18:31,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:18:31,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:18:31,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:18:31,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:18:31,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:18:31,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:18:31,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:18:31,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:18:31,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:18:31,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:18:31,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:18:31,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:18:31,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:18:31,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:18:31,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:18:31,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:18:31,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:18:31,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:18:31,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:18:31,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:18:31,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:18:31,933 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 13:18:31,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:18:31,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:18:31,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:18:31,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:18:31,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:18:31,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:18:31,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:18:31,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:18:31,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:18:31,950 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:18:31,950 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:18:31,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:18:31,950 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:18:31,950 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 13:18:32,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:18:32,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:18:32,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:18:32,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:18:32,156 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:18:32,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-15 13:18:32,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd0f6386/7adfcba42d0545378c78018ae8c8209c/FLAGcdc9dc6b8 [2022-04-15 13:18:32,543 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:18:32,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-15 13:18:32,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd0f6386/7adfcba42d0545378c78018ae8c8209c/FLAGcdc9dc6b8 [2022-04-15 13:18:32,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd0f6386/7adfcba42d0545378c78018ae8c8209c [2022-04-15 13:18:33,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:18:33,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:18:33,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:18:33,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:18:33,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:18:33,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a29ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33, skipping insertion in model container [2022-04-15 13:18:33,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:18:33,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:18:33,146 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/dijkstra-u.c[525,538] [2022-04-15 13:18:33,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:18:33,172 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:18:33,183 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/dijkstra-u.c[525,538] [2022-04-15 13:18:33,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:18:33,216 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:18:33,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33 WrapperNode [2022-04-15 13:18:33,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:18:33,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:18:33,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:18:33,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:18:33,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:18:33,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:18:33,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:18:33,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:18:33,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (1/1) ... [2022-04-15 13:18:33,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:18:33,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:33,270 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 13:18:33,271 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 13:18:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:18:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:18:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:18:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:18:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:18:33,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:18:33,299 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:18:33,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:18:33,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:18:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:18:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:18:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:18:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:18:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:18:33,347 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:18:33,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:18:33,521 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:18:33,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:18:33,527 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:18:33,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:18:33 BoogieIcfgContainer [2022-04-15 13:18:33,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:18:33,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:18:33,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:18:33,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:18:33,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:18:33" (1/3) ... [2022-04-15 13:18:33,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a8b789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:18:33, skipping insertion in model container [2022-04-15 13:18:33,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:33" (2/3) ... [2022-04-15 13:18:33,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a8b789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:18:33, skipping insertion in model container [2022-04-15 13:18:33,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:18:33" (3/3) ... [2022-04-15 13:18:33,537 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u.c [2022-04-15 13:18:33,540 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:18:33,540 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:18:33,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:18:33,591 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 13:18:33,591 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:18:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 13:18:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:18:33,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:33,618 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:33,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 1 times [2022-04-15 13:18:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634141206] [2022-04-15 13:18:33,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 2 times [2022-04-15 13:18:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923234060] [2022-04-15 13:18:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:33,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(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); {40#true} is VALID [2022-04-15 13:18:33,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 13:18:33,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-15 13:18:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:33,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 13:18:33,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 13:18:33,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 13:18:33,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 13:18:33,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:33,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(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); {40#true} is VALID [2022-04-15 13:18:33,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 13:18:33,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-15 13:18:33,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret5 := main(); {40#true} is VALID [2022-04-15 13:18:33,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-15 13:18:33,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {40#true} is VALID [2022-04-15 13:18:33,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 13:18:33,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 13:18:33,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 13:18:33,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 13:18:33,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {41#false} is VALID [2022-04-15 13:18:33,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-15 13:18:33,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-15 13:18:33,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#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)); {41#false} is VALID [2022-04-15 13:18:33,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 13:18:33,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 13:18:33,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 13:18:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923234060] [2022-04-15 13:18:33,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923234060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:33,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:18:33,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:33,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634141206] [2022-04-15 13:18:33,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634141206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:33,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:33,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:18:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329563938] [2022-04-15 13:18:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:33,824 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 13:18:33,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:33,827 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:33,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:33,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:18:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:18:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:18:33,873 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,250 INFO L93 Difference]: Finished difference Result 65 states and 105 transitions. [2022-04-15 13:18:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:18:34,251 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 13:18:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:34,252 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 13:18:34,268 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 13:18:34,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-15 13:18:34,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:34,390 INFO L225 Difference]: With dead ends: 65 [2022-04-15 13:18:34,390 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:18:34,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 13:18:34,394 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:34,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:18:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:18:34,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:34,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 13:18:34,417 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 13:18:34,417 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 13:18:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,425 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:18:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:18:34,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:34,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:34,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-15 13:18:34,428 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-15 13:18:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,437 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:18:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:18:34,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:34,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:34,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:34,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 13:18:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 13:18:34,441 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-15 13:18:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:34,442 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 13:18:34,443 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:34,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 13:18:34,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:18:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:18:34,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:34,484 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:34,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:18:34,485 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 1 times [2022-04-15 13:18:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:34,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575412195] [2022-04-15 13:18:34,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 2 times [2022-04-15 13:18:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:34,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444688839] [2022-04-15 13:18:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:34,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#(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); {310#true} is VALID [2022-04-15 13:18:34,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-15 13:18:34,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-15 13:18:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:34,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-15 13:18:34,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-15 13:18:34,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-15 13:18:34,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-15 13:18:34,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:34,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#(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); {310#true} is VALID [2022-04-15 13:18:34,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-15 13:18:34,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-15 13:18:34,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret5 := main(); {310#true} is VALID [2022-04-15 13:18:34,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {310#true} is VALID [2022-04-15 13:18:34,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {310#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {310#true} is VALID [2022-04-15 13:18:34,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-15 13:18:34,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-15 13:18:34,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-15 13:18:34,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-15 13:18:34,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 13:18:34,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 13:18:34,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {320#(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 13:18:34,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(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; {320#(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 13:18:34,773 INFO L272 TraceCheckUtils]: 15: Hoare triple {320#(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)); {321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:34,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:18:34,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {311#false} is VALID [2022-04-15 13:18:34,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-15 13:18:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444688839] [2022-04-15 13:18:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444688839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:34,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:18:34,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575412195] [2022-04-15 13:18:34,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575412195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:34,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:34,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:18:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102049533] [2022-04-15 13:18:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:34,776 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 13:18:34,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:34,776 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:34,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:34,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:18:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:34,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:18:34,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:18:34,791 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:38,831 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 13:18:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:43,997 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2022-04-15 13:18:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:18:43,997 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 13:18:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:43,998 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-15 13:18:44,001 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-15 13:18:44,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-15 13:18:44,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:44,205 INFO L225 Difference]: With dead ends: 67 [2022-04-15 13:18:44,205 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:18:44,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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 13:18:44,206 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:44,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 51 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-04-15 13:18:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:18:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 13:18:44,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:44,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:18:44,221 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:18:44,221 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:18:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:44,224 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 13:18:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-15 13:18:44,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:44,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:44,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 47 states. [2022-04-15 13:18:44,226 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 47 states. [2022-04-15 13:18:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:44,228 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-15 13:18:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-15 13:18:44,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:44,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:44,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:44,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:18:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-04-15 13:18:44,231 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 19 [2022-04-15 13:18:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:44,231 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-04-15 13:18:44,232 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:44,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 63 transitions. [2022-04-15 13:18:44,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-15 13:18:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:18:44,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:44,367 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:44,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:18:44,367 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1182987237, now seen corresponding path program 1 times [2022-04-15 13:18:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913889095] [2022-04-15 13:18:44,436 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1490295832, now seen corresponding path program 1 times [2022-04-15 13:18:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113348881] [2022-04-15 13:18:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:44,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#(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); {658#true} is VALID [2022-04-15 13:18:44,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-15 13:18:44,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-15 13:18:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:44,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-15 13:18:44,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-15 13:18:44,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-15 13:18:44,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-15 13:18:44,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:44,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#(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); {658#true} is VALID [2022-04-15 13:18:44,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-15 13:18:44,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-15 13:18:44,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret5 := main(); {658#true} is VALID [2022-04-15 13:18:44,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {658#true} is VALID [2022-04-15 13:18:44,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {658#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {658#true} is VALID [2022-04-15 13:18:44,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-15 13:18:44,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-15 13:18:44,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-15 13:18:44,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-15 13:18:44,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 13:18:44,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [104] L29-2-->L30_primed: Formula: (or (= v_main_~n~0_In_1 v_main_~n~0_In_1) (and (= (mod v_main_~q~0_Out_2 4) 0) (= v_main_~n~0_In_1 0) (<= (mod (div v_main_~q~0_Out_2 4) 4294967296) (mod v_main_~n~0_In_1 4294967296)))) InVars {main_~n~0=v_main_~n~0_In_1} OutVars{main_~q~0=v_main_~q~0_Out_2, main_~n~0=v_main_~n~0_In_1} AuxVars[] AssignedVars[main_~q~0] {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 13:18:44,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [103] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 13:18:44,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {668#(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 13:18:44,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#(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; {668#(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 13:18:44,580 INFO L272 TraceCheckUtils]: 16: Hoare triple {668#(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)); {669#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:44,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {669#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {670#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:18:44,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {659#false} is VALID [2022-04-15 13:18:44,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-15 13:18:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:44,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113348881] [2022-04-15 13:18:44,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113348881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:44,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:44,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:18:44,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:44,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913889095] [2022-04-15 13:18:44,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913889095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:44,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:44,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050916180] [2022-04-15 13:18:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:44,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:18:44,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:44,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:44,635 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 13:18:44,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:18:44,636 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:18:53,804 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 13:19:00,049 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 13:19:02,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:04,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:06,430 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 13:19:09,589 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 13:19:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:17,121 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2022-04-15 13:19:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:19:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 13:19:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:19:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 13:19:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:19:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 13:19:17,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-04-15 13:19:17,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:17,912 INFO L225 Difference]: With dead ends: 80 [2022-04-15 13:19:17,912 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 13:19:17,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:19:17,913 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 95 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:17,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 56 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 21.0s Time] [2022-04-15 13:19:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 13:19:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 13:19:17,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:17,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 13:19:17,961 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 13:19:17,961 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 13:19:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:17,965 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2022-04-15 13:19:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2022-04-15 13:19:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:17,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:17,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 69 states. [2022-04-15 13:19:17,967 INFO L87 Difference]: Start difference. First operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 69 states. [2022-04-15 13:19:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:17,970 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2022-04-15 13:19:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2022-04-15 13:19:17,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:17,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:17,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:17,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 13:19:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2022-04-15 13:19:17,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 21 [2022-04-15 13:19:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:17,974 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2022-04-15 13:19:17,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:19:17,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 97 transitions. [2022-04-15 13:19:20,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2022-04-15 13:19:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:19:20,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:20,770 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:20,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:19:20,771 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 1 times [2022-04-15 13:19:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:20,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711453412] [2022-04-15 13:19:20,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:19:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 2 times [2022-04-15 13:19:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:20,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609812300] [2022-04-15 13:19:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:20,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:20,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904386701] [2022-04-15 13:19:20,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:19:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:20,790 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 13:19:20,801 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 13:19:20,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:19:20,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:20,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:19:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:21,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2022-04-15 13:19:21,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#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); {1123#true} is VALID [2022-04-15 13:19:21,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2022-04-15 13:19:21,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #100#return; {1123#true} is VALID [2022-04-15 13:19:21,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret5 := main(); {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1123#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {1123#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1123#true} ~cond := #in~cond; {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#true} assume !(0 == ~cond); {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {1123#true} assume true; {1123#true} is VALID [2022-04-15 13:19:21,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1123#true} {1123#true} #80#return; {1123#true} is VALID [2022-04-15 13:19:21,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1123#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,061 INFO L272 TraceCheckUtils]: 15: Hoare triple {1161#(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)); {1123#true} is VALID [2022-04-15 13:19:21,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1123#true} ~cond := #in~cond; {1123#true} is VALID [2022-04-15 13:19:21,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1123#true} assume !(0 == ~cond); {1123#true} is VALID [2022-04-15 13:19:21,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#true} assume true; {1123#true} is VALID [2022-04-15 13:19:21,062 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1123#true} {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #82#return; {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,063 INFO L272 TraceCheckUtils]: 20: Hoare triple {1161#(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)); {1123#true} is VALID [2022-04-15 13:19:21,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#true} ~cond := #in~cond; {1123#true} is VALID [2022-04-15 13:19:21,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#true} assume !(0 == ~cond); {1123#true} is VALID [2022-04-15 13:19:21,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1123#true} assume true; {1123#true} is VALID [2022-04-15 13:19:21,066 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1123#true} {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {1161#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 13:19:21,067 INFO L272 TraceCheckUtils]: 25: Hoare triple {1161#(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)); {1204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:21,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {1204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:21,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {1208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1124#false} is VALID [2022-04-15 13:19:21,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2022-04-15 13:19:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:19:21,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:19:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609812300] [2022-04-15 13:19:21,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:19:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904386701] [2022-04-15 13:19:21,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904386701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:21,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:21,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:19:21,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:21,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711453412] [2022-04-15 13:19:21,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711453412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:21,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:21,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:19:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834644004] [2022-04-15 13:19:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:21,071 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 13:19:21,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:21,071 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:21,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:21,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:19:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:21,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:19:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:19:21,095 INFO L87 Difference]: Start difference. First operand 68 states and 97 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:24,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:29,653 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2022-04-15 13:19:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:19:29,654 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 13:19:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:29,654 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 13:19:29,655 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 13:19:29,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 13:19:29,723 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 13:19:29,724 INFO L225 Difference]: With dead ends: 79 [2022-04-15 13:19:29,724 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:19:29,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 13:19:29,725 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:29,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 13:19:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:19:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 13:19:29,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:29,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:19:29,747 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:19:29,747 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:19:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:29,752 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2022-04-15 13:19:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2022-04-15 13:19:29,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:29,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:29,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 56 states. [2022-04-15 13:19:29,757 INFO L87 Difference]: Start difference. First operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 56 states. [2022-04-15 13:19:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:29,762 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2022-04-15 13:19:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2022-04-15 13:19:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:29,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:29,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:19:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2022-04-15 13:19:29,766 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 29 [2022-04-15 13:19:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:29,766 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2022-04-15 13:19:29,766 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:29,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 79 transitions. [2022-04-15 13:19:30,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2022-04-15 13:19:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:19:30,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:30,120 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-15 13:19:30,130 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 13:19:30,321 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 13:19:30,323 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1684913467, now seen corresponding path program 1 times [2022-04-15 13:19:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584860071] [2022-04-15 13:19:30,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:19:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1174784712, now seen corresponding path program 1 times [2022-04-15 13:19:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:30,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455356165] [2022-04-15 13:19:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:30,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590916674] [2022-04-15 13:19:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:30,430 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 13:19:30,431 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 13:19:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:30,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:19:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:30,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:30,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {1598#true} call ULTIMATE.init(); {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#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); {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1598#true} {1598#true} #100#return; {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {1598#true} call #t~ret5 := main(); {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {1598#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {1598#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1598#true} is VALID [2022-04-15 13:19:30,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {1598#true} ~cond := #in~cond; {1598#true} is VALID [2022-04-15 13:19:30,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1598#true} assume !(0 == ~cond); {1598#true} is VALID [2022-04-15 13:19:30,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-04-15 13:19:30,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1598#true} {1598#true} #80#return; {1598#true} is VALID [2022-04-15 13:19:30,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {1598#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1636#(and (= main_~p~0 0) (= main_~h~0 0))} [106] L29-2-->L30_primed: Formula: (or (= v_main_~n~0_In_2 v_main_~n~0_In_2) (and (= (mod (* 3 v_main_~q~0_Out_4) 4) 0) (<= (mod (div (- v_main_~q~0_Out_4) (- 4)) 4294967296) (mod v_main_~n~0_In_2 4294967296)) (= v_main_~n~0_In_2 0))) InVars {main_~n~0=v_main_~n~0_In_2} OutVars{main_~q~0=v_main_~q~0_Out_4, main_~n~0=v_main_~n~0_In_2} AuxVars[] AssignedVars[main_~q~0] {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {1636#(and (= main_~p~0 0) (= main_~h~0 0))} [105] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1636#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {1636#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,652 INFO L272 TraceCheckUtils]: 16: Hoare triple {1636#(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)); {1598#true} is VALID [2022-04-15 13:19:30,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {1598#true} ~cond := #in~cond; {1598#true} is VALID [2022-04-15 13:19:30,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1598#true} assume !(0 == ~cond); {1598#true} is VALID [2022-04-15 13:19:30,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-04-15 13:19:30,653 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1598#true} {1636#(and (= main_~p~0 0) (= main_~h~0 0))} #82#return; {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,653 INFO L272 TraceCheckUtils]: 21: Hoare triple {1636#(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)); {1598#true} is VALID [2022-04-15 13:19:30,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#true} ~cond := #in~cond; {1598#true} is VALID [2022-04-15 13:19:30,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#true} assume !(0 == ~cond); {1598#true} is VALID [2022-04-15 13:19:30,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#true} assume true; {1598#true} is VALID [2022-04-15 13:19:30,654 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1598#true} {1636#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {1636#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 13:19:30,655 INFO L272 TraceCheckUtils]: 26: Hoare triple {1636#(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)); {1682#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:30,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {1682#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1686#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:30,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {1686#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1599#false} is VALID [2022-04-15 13:19:30,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {1599#false} assume !false; {1599#false} is VALID [2022-04-15 13:19:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:19:30,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:19:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:30,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455356165] [2022-04-15 13:19:30,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:19:30,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590916674] [2022-04-15 13:19:30,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590916674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:30,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:30,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:19:30,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584860071] [2022-04-15 13:19:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584860071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:30,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:30,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:19:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389872345] [2022-04-15 13:19:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-15 13:19:30,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:30,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:30,710 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 13:19:30,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:19:30,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:30,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:19:30,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:19:30,711 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:19:34,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:36,022 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 13:19:44,271 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 13:19:46,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:48,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:59,800 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 13:20:01,805 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 13:20:03,809 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 13:20:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:03,816 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2022-04-15 13:20:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:20:03,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-15 13:20:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:20:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 13:20:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:20:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 13:20:03,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-15 13:20:03,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:03,904 INFO L225 Difference]: With dead ends: 66 [2022-04-15 13:20:03,904 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 13:20:03,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:20:03,905 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:03,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 170 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 18.3s Time] [2022-04-15 13:20:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 13:20:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-15 13:20:03,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:03,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:20:03,938 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:20:03,938 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:20:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:03,941 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-15 13:20:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-15 13:20:03,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:03,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:03,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 64 states. [2022-04-15 13:20:03,941 INFO L87 Difference]: Start difference. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 64 states. [2022-04-15 13:20:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:03,944 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-15 13:20:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-15 13:20:03,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:03,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:03,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:03,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 13:20:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-04-15 13:20:03,946 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 31 [2022-04-15 13:20:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:03,947 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-04-15 13:20:03,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 13:20:03,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 85 transitions. [2022-04-15 13:20:04,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-15 13:20:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:20:04,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:04,274 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2022-04-15 13:20:04,286 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 13:20:04,478 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 13:20:04,479 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1928736347, now seen corresponding path program 1 times [2022-04-15 13:20:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675569088] [2022-04-15 13:20:04,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:20:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1215161544, now seen corresponding path program 1 times [2022-04-15 13:20:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949381077] [2022-04-15 13:20:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:04,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:20:04,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347217283] [2022-04-15 13:20:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:04,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:04,586 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 13:20:04,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process