/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:18:43,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:18:43,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:18:43,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:18:43,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:18:43,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:18:43,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:18:43,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:18:43,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:18:43,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:18:43,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:18:43,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:18:43,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:18:43,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:18:43,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:18:43,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:18:43,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:18:43,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:18:43,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:18:43,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:18:43,527 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:18:43,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:18:43,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:18:43,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:18:43,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:18:43,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:18:43,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:18:43,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:18:43,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:18:43,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:18:43,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:18:43,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:18:43,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:18:43,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:18:43,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:18:43,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:18:43,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:18:43,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:18:43,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:18:43,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:18:43,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:18:43,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:18:43,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:18:43,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:18:43,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:18:43,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:18:43,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:18:43,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:18:43,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:18:43,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:18:43,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:18:43,571 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:18:43,575 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:18:43,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:18:43,575 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:18:43,576 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-28 06:18:43,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:18:43,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:18:43,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:18:43,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:18:43,991 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:18:43,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c [2022-04-28 06:18:44,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457136496/ef57c15e65d5467d9ee0f8b9ebf4ad33/FLAGc68e4855d [2022-04-28 06:18:44,807 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:18:44,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c [2022-04-28 06:18:44,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457136496/ef57c15e65d5467d9ee0f8b9ebf4ad33/FLAGc68e4855d [2022-04-28 06:18:45,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457136496/ef57c15e65d5467d9ee0f8b9ebf4ad33 [2022-04-28 06:18:45,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:18:45,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:18:45,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:18:45,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:18:45,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:18:45,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cad29ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45, skipping insertion in model container [2022-04-28 06:18:45,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:18:45,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:18:45,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c[537,550] [2022-04-28 06:18:45,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:18:45,583 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:18:45,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c[537,550] [2022-04-28 06:18:45,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:18:45,650 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:18:45,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45 WrapperNode [2022-04-28 06:18:45,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:18:45,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:18:45,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:18:45,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:18:45,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:18:45,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:18:45,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:18:45,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:18:45,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (1/1) ... [2022-04-28 06:18:45,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:18:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:45,865 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-28 06:18:45,916 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-28 06:18:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:18:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:18:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:18:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:18:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:18:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:18:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:18:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:18:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:18:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:18:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 06:18:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:18:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:18:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:18:46,044 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:18:46,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:18:46,311 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:18:46,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:18:46,317 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 06:18:46,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:18:46 BoogieIcfgContainer [2022-04-28 06:18:46,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:18:46,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:18:46,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:18:46,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:18:46,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:18:45" (1/3) ... [2022-04-28 06:18:46,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7749ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:18:46, skipping insertion in model container [2022-04-28 06:18:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:18:45" (2/3) ... [2022-04-28 06:18:46,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7749ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:18:46, skipping insertion in model container [2022-04-28 06:18:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:18:46" (3/3) ... [2022-04-28 06:18:46,357 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound10.c [2022-04-28 06:18:46,369 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:18:46,369 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:18:46,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:18:46,434 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17c864e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56a69053 [2022-04-28 06:18:46,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:18:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 06:18:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 06:18:46,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:46,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:46,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-28 06:18:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:46,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693297161] [2022-04-28 06:18:46,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-28 06:18:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:46,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449406491] [2022-04-28 06:18:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:18:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:46,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 06:18:46,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 06:18:46,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 06:18:46,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 06:18:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:46,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 06:18:46,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 06:18:46,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 06:18:46,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 06:18:46,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:18:46,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 06:18:46,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 06:18:46,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 06:18:46,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-28 06:18:46,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-28 06:18:46,776 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 06:18:46,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 06:18:46,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 06:18:46,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 06:18:46,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 06:18:46,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-28 06:18:46,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 06:18:46,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 06:18:46,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-28 06:18:46,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 06:18:46,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 06:18:46,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 06:18:46,780 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-28 06:18:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449406491] [2022-04-28 06:18:46,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449406491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:46,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:46,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:18:46,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693297161] [2022-04-28 06:18:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693297161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:46,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:46,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:18:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819476658] [2022-04-28 06:18:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:46,792 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-28 06:18:46,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:46,796 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-28 06:18:46,827 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-28 06:18:46,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:18:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:18:46,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:18:46,852 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-28 06:18:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:47,191 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-28 06:18:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:18:47,191 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-28 06:18:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:47,193 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-28 06:18:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 06:18:47,217 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-28 06:18:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 06:18:47,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 06:18:47,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:47,429 INFO L225 Difference]: With dead ends: 66 [2022-04-28 06:18:47,429 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 06:18:47,432 INFO L412 NwaCegarLoop]: 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-28 06:18:47,436 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:47,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:18:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 06:18:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 06:18:47,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:47,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:47,492 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:47,492 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:47,503 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 06:18:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 06:18:47,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:47,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:47,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 06:18:47,506 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 06:18:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:47,511 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 06:18:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 06:18:47,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:47,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:47,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:47,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 06:18:47,516 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 06:18:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:47,516 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 06:18:47,517 INFO L496 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-28 06:18:47,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 06:18:47,585 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-28 06:18:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 06:18:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 06:18:47,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:47,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:47,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:18:47,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-28 06:18:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:47,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501865570] [2022-04-28 06:18:47,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-28 06:18:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:47,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155009951] [2022-04-28 06:18:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:18:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:47,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-28 06:18:47,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 06:18:47,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 06:18:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 06:18:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:47,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 06:18:47,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 06:18:47,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 06:18:47,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 06:18:47,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:18:47,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-28 06:18:47,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 06:18:47,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 06:18:47,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-28 06:18:47,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID [2022-04-28 06:18:47,776 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-28 06:18:47,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 06:18:47,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 06:18:47,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 06:18:47,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 06:18:47,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-28 06:18:47,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 06:18:47,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 06:18:47,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:18:47,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:18:47,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-28 06:18:47,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-28 06:18:47,786 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-28 06:18:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:47,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155009951] [2022-04-28 06:18:47,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155009951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:47,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:47,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:47,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501865570] [2022-04-28 06:18:47,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501865570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:47,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:47,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313259246] [2022-04-28 06:18:47,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:47,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 06:18:47,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:47,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 06:18:47,807 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-28 06:18:47,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:18:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:18:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:18:47,809 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 06:18:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,228 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 06:18:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:18:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 06:18:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 06:18:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 06:18:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 06:18:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 06:18:48,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 06:18:48,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:48,315 INFO L225 Difference]: With dead ends: 47 [2022-04-28 06:18:48,315 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 06:18:48,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:18:48,318 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:48,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:18:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 06:18:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-28 06:18:48,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:48,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,349 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,351 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,361 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 06:18:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 06:18:48,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:48,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:48,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 06:18:48,369 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 06:18:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,376 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 06:18:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 06:18:48,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:48,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:48,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:48,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 06:18:48,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-28 06:18:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:48,382 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 06:18:48,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 06:18:48,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 06:18:48,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 06:18:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 06:18:48,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:48,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:48,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 06:18:48,441 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:48,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-28 06:18:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2137241969] [2022-04-28 06:18:48,444 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-28 06:18:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792538381] [2022-04-28 06:18:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:48,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:48,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276145200] [2022-04-28 06:18:48,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:48,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:48,474 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-28 06:18:48,475 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-28 06:18:48,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:18:48,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:48,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 06:18:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:48,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:48,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-28 06:18:48,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,722 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:48,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-28 06:18:48,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {594#false} is VALID [2022-04-28 06:18:48,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-28 06:18:48,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 10);havoc #t~post7; {594#false} is VALID [2022-04-28 06:18:48,724 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-28 06:18:48,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-28 06:18:48,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-28 06:18:48,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-28 06:18:48,725 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-28 06:18:48,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:18:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:48,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792538381] [2022-04-28 06:18:48,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:48,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276145200] [2022-04-28 06:18:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276145200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:48,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:48,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:18:48,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2137241969] [2022-04-28 06:18:48,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2137241969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:48,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:48,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:18:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868875970] [2022-04-28 06:18:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:18:48,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:48,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:18:48,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:48,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:18:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:18:48,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:18:48,748 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:18:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,835 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-28 06:18:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:18:48,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:18:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:18:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 06:18:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:18:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 06:18:48,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 06:18:48,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:48,896 INFO L225 Difference]: With dead ends: 52 [2022-04-28 06:18:48,896 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 06:18:48,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:18:48,899 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:48,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:18:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 06:18:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 06:18:48,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:48,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,923 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,924 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,926 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 06:18:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 06:18:48,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:48,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:48,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 06:18:48,927 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 06:18:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:48,931 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 06:18:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 06:18:48,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:48,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:48,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:48,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 06:18:48,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-28 06:18:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:48,937 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 06:18:48,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:18:48,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-28 06:18:48,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 06:18:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 06:18:48,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:48,980 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:49,012 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-28 06:18:49,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:49,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-28 06:18:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:49,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749152117] [2022-04-28 06:18:49,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-28 06:18:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:49,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083396618] [2022-04-28 06:18:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:18:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:49,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-28 06:18:49,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 06:18:49,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 06:18:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:49,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 06:18:49,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 06:18:49,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 06:18:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 06:18:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:49,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 06:18:49,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 06:18:49,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 06:18:49,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:18:49,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-28 06:18:49,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 06:18:49,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-28 06:18:49,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID [2022-04-28 06:18:49,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-28 06:18:49,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 06:18:49,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 06:18:49,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 06:18:49,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 06:18:49,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 06:18:49,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 10);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 06:18:49,356 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID [2022-04-28 06:18:49,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 06:18:49,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 06:18:49,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 06:18:49,358 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 06:18:49,359 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:18:49,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:18:49,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-28 06:18:49,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 06:18:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:18:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:49,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083396618] [2022-04-28 06:18:49,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083396618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:49,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:49,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:49,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749152117] [2022-04-28 06:18:49,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749152117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:49,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:49,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075011339] [2022-04-28 06:18:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 06:18:49,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:49,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:18:49,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:49,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:18:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:18:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:18:49,381 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:18:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:49,837 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 06:18:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:18:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 06:18:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:18:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 06:18:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:18:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 06:18:49,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 06:18:49,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:49,906 INFO L225 Difference]: With dead ends: 52 [2022-04-28 06:18:49,906 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 06:18:49,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:18:49,907 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:18:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 06:18:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-28 06:18:49,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:49,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:49,921 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:49,922 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:49,924 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:18:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:18:49,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:49,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:49,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 06:18:49,925 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 06:18:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:49,927 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:18:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:18:49,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:49,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:49,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:49,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:18:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 06:18:49,930 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-28 06:18:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:49,931 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 06:18:49,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:18:49,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 06:18:49,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 06:18:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 06:18:49,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:49,979 INFO L195 NwaCegarLoop]: 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] [2022-04-28 06:18:49,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 06:18:49,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-28 06:18:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133335506] [2022-04-28 06:18:49,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-28 06:18:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:49,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727295772] [2022-04-28 06:18:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:49,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930536703] [2022-04-28 06:18:49,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:49,997 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-28 06:18:49,999 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-28 06:18:50,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:18:50,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:50,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:18:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:50,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-28 06:18:50,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID [2022-04-28 06:18:50,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 06:18:50,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-28 06:18:50,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-28 06:18:50,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID [2022-04-28 06:18:50,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-28 06:18:50,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 06:18:50,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 06:18:50,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 06:18:50,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-28 06:18:50,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:18:50,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:18:50,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:18:50,235 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-28 06:18:50,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 06:18:50,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 06:18:50,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 06:18:50,236 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:18:50,237 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-28 06:18:50,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 06:18:50,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 06:18:50,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 06:18:50,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:18:50,239 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:18:50,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:18:50,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-28 06:18:50,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-28 06:18:50,240 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-28 06:18:50,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:18:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727295772] [2022-04-28 06:18:50,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930536703] [2022-04-28 06:18:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930536703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:50,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133335506] [2022-04-28 06:18:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133335506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:50,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:50,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49341552] [2022-04-28 06:18:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:50,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-04-28 06:18:50,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:50,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 06:18:50,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:18:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:50,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:18:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:18:50,265 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 06:18:52,490 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-28 06:18:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:52,646 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 06:18:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:18:52,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-04-28 06:18:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 06:18:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 06:18:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 06:18:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 06:18:52,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-28 06:18:52,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:52,718 INFO L225 Difference]: With dead ends: 59 [2022-04-28 06:18:52,718 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 06:18:52,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-28 06:18:52,719 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:52,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 06:18:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 06:18:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 06:18:52,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:52,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:52,738 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:52,738 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:52,740 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 06:18:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 06:18:52,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:52,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:52,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 06:18:52,742 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 06:18:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:52,744 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 06:18:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 06:18:52,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:52,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:52,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:52,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-28 06:18:52,747 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-28 06:18:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:52,747 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-28 06:18:52,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-28 06:18:52,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-28 06:18:52,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 06:18:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 06:18:52,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:52,827 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:52,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 06:18:53,031 WARN L477 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-28 06:18:53,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-28 06:18:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:53,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129286881] [2022-04-28 06:18:53,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-28 06:18:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582003746] [2022-04-28 06:18:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:53,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322490469] [2022-04-28 06:18:53,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:53,046 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-28 06:18:53,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:18:53,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:18:53,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:53,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:18:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:53,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:53,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-28 06:18:53,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:53,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,332 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,334 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,336 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,336 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,338 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:53,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID [2022-04-28 06:18:53,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1660#false} is VALID [2022-04-28 06:18:53,340 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-28 06:18:53,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-28 06:18:53,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-28 06:18:53,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-28 06:18:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:18:53,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:18:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582003746] [2022-04-28 06:18:53,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322490469] [2022-04-28 06:18:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322490469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:53,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:53,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:53,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129286881] [2022-04-28 06:18:53,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129286881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:53,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:53,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071792060] [2022-04-28 06:18:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 06:18:53,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:53,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:18:53,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:18:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:18:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:18:53,375 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:18:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:53,572 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-28 06:18:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:18:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 06:18:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:18:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 06:18:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:18:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 06:18:53,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 06:18:53,634 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-28 06:18:53,636 INFO L225 Difference]: With dead ends: 76 [2022-04-28 06:18:53,636 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 06:18:53,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:18:53,638 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:53,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:18:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 06:18:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 06:18:53,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:53,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:53,687 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:53,688 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:53,690 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 06:18:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 06:18:53,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:53,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:53,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 06:18:53,691 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 06:18:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:53,694 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 06:18:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 06:18:53,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:53,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:53,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:53,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:18:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-28 06:18:53,697 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-28 06:18:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:53,698 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-28 06:18:53,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:18:53,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions. [2022-04-28 06:18:53,793 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-28 06:18:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-28 06:18:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 06:18:53,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:53,794 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:53,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:18:53,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:53,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-28 06:18:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235696133] [2022-04-28 06:18:53,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:18:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-28 06:18:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707581796] [2022-04-28 06:18:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:54,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:54,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803695580] [2022-04-28 06:18:54,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:54,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:54,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:54,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:18:54,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:18:54,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:18:54,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:54,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 06:18:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:54,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:54,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-28 06:18:54,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID [2022-04-28 06:18:54,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 06:18:54,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID [2022-04-28 06:18:54,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 06:18:54,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID [2022-04-28 06:18:54,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 10);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,647 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 06:18:54,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 06:18:54,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 06:18:54,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 06:18:54,648 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 06:18:54,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 06:18:54,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 06:18:54,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 06:18:54,649 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,649 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 06:18:54,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 06:18:54,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 06:18:54,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 06:18:54,650 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 06:18:54,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 06:18:54,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 06:18:54,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 06:18:54,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:18:54,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:18:54,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID [2022-04-28 06:18:54,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-28 06:18:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:18:54,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:18:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:54,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707581796] [2022-04-28 06:18:54,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:54,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803695580] [2022-04-28 06:18:54,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803695580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:54,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:54,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:54,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235696133] [2022-04-28 06:18:54,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235696133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:54,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:54,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:18:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362362643] [2022-04-28 06:18:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:54,659 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 06:18:54,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:54,660 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:54,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:54,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:18:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:18:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:18:54,701 INFO L87 Difference]: Start difference. First operand 68 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:55,338 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-28 06:18:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 06:18:55,339 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 06:18:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:55,339 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 06:18:55,341 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 06:18:55,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-28 06:18:55,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:55,444 INFO L225 Difference]: With dead ends: 82 [2022-04-28 06:18:55,445 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 06:18:55,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:18:55,445 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:55,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:18:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 06:18:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-28 06:18:55,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:55,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:18:55,506 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:18:55,507 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:18:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:55,510 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 06:18:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 06:18:55,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:55,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:55,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 06:18:55,512 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 06:18:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:55,517 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 06:18:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 06:18:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:55,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:55,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:55,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:18:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-28 06:18:55,521 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-28 06:18:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:55,521 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-28 06:18:55,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:55,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions. [2022-04-28 06:18:55,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-28 06:18:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 06:18:55,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:55,651 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-28 06:18:55,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 06:18:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:55,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-28 06:18:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789718303] [2022-04-28 06:18:56,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:18:56,915 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:18:56,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:18:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 2 times [2022-04-28 06:18:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:56,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670247002] [2022-04-28 06:18:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:56,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:56,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056054716] [2022-04-28 06:18:56,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:56,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:18:56,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:18:57,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:18:57,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:57,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:18:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:57,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:57,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-28 06:18:57,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2792#true} is VALID [2022-04-28 06:18:57,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 06:18:57,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 06:18:57,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID [2022-04-28 06:18:57,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,213 INFO L272 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 06:18:57,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 06:18:57,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 06:18:57,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 06:18:57,214 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,214 INFO L272 TraceCheckUtils]: 19: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 06:18:57,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 06:18:57,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 06:18:57,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 06:18:57,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #84#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,216 INFO L272 TraceCheckUtils]: 24: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 06:18:57,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 06:18:57,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 06:18:57,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 06:18:57,217 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #86#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 10);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 10);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:18:57,225 INFO L272 TraceCheckUtils]: 34: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:18:57,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:18:57,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {2904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-28 06:18:57,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-28 06:18:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 06:18:57,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:18:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:57,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670247002] [2022-04-28 06:18:57,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:57,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056054716] [2022-04-28 06:18:57,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056054716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:57,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:57,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:57,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:57,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789718303] [2022-04-28 06:18:57,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789718303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:57,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:57,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928557582] [2022-04-28 06:18:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-28 06:18:57,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:57,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:57,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:57,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:18:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:18:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:18:57,274 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:57,600 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-28 06:18:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:18:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-28 06:18:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 06:18:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 06:18:57,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-28 06:18:57,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:57,669 INFO L225 Difference]: With dead ends: 92 [2022-04-28 06:18:57,670 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 06:18:57,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-28 06:18:57,670 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:57,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:18:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 06:18:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 06:18:57,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:57,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:57,753 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:57,754 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:57,759 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-28 06:18:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 06:18:57,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:57,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:57,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-28 06:18:57,761 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-28 06:18:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:57,764 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-28 06:18:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 06:18:57,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:57,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:57,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:57,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-04-28 06:18:57,769 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 38 [2022-04-28 06:18:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:57,769 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-04-28 06:18:57,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:18:57,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 109 transitions. [2022-04-28 06:18:57,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-04-28 06:18:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 06:18:57,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:18:57,913 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:18:57,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 06:18:58,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:58,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:18:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:18:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-28 06:18:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994322355] [2022-04-28 06:18:59,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:18:59,073 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:18:59,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:18:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-28 06:18:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:18:59,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613700701] [2022-04-28 06:18:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:18:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:18:59,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:18:59,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861391487] [2022-04-28 06:18:59,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:18:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:18:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:18:59,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:18:59,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 06:18:59,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:18:59,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:18:59,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:18:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:18:59,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:18:59,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-28 06:18:59,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#(<= ~counter~0 0)} ~cond := #in~cond; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#(<= ~counter~0 0)} assume !(0 == ~cond); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3462#(<= ~counter~0 0)} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 06:18:59,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,352 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,353 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,356 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,357 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 06:18:59,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 10);havoc #t~post7; {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#false} assume !(0 == ~cond); {3455#false} is VALID [2022-04-28 06:18:59,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#false} assume true; {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3455#false} {3455#false} #92#return; {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-28 06:18:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 06:18:59,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:18:59,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 06:18:59,580 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 06:18:59,580 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3454#true} {3455#false} #92#return; {3455#false} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 06:18:59,580 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 06:18:59,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 10);havoc #t~post7; {3455#false} is VALID [2022-04-28 06:18:59,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-28 06:18:59,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {3621#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3455#false} is VALID [2022-04-28 06:18:59,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3621#(< |main_#t~post6| 10)} is VALID [2022-04-28 06:18:59,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#(< ~counter~0 10)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,584 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3454#true} {3625#(< ~counter~0 10)} #86#return; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 06:18:59,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 06:18:59,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 06:18:59,585 INFO L272 TraceCheckUtils]: 24: Hoare triple {3625#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 06:18:59,587 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3454#true} {3625#(< ~counter~0 10)} #84#return; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 06:18:59,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 06:18:59,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 06:18:59,588 INFO L272 TraceCheckUtils]: 19: Hoare triple {3625#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 06:18:59,589 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3454#true} {3625#(< ~counter~0 10)} #82#return; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 06:18:59,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 06:18:59,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 06:18:59,589 INFO L272 TraceCheckUtils]: 14: Hoare triple {3625#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 06:18:59,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {3625#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {3680#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3625#(< ~counter~0 10)} is VALID [2022-04-28 06:18:59,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {3680#(< ~counter~0 9)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3454#true} {3680#(< ~counter~0 9)} #80#return; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 06:18:59,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 06:18:59,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 06:18:59,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {3680#(< ~counter~0 9)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3454#true} is VALID [2022-04-28 06:18:59,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3680#(< ~counter~0 9)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {3680#(< ~counter~0 9)} call #t~ret8 := main(); {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3680#(< ~counter~0 9)} {3454#true} #96#return; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3680#(< ~counter~0 9)} assume true; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3680#(< ~counter~0 9)} is VALID [2022-04-28 06:18:59,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-28 06:18:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 06:18:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:18:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613700701] [2022-04-28 06:18:59,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:18:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861391487] [2022-04-28 06:18:59,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861391487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:18:59,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:18:59,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:18:59,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:18:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994322355] [2022-04-28 06:18:59,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994322355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:18:59,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:18:59,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:18:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524203360] [2022-04-28 06:18:59,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:18:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 06:18:59,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:18:59,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 06:18:59,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:59,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:18:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:18:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:18:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:18:59,623 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 06:18:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:59,842 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-28 06:18:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:18:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 06:18:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:18:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 06:18:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 06:18:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 06:18:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 06:18:59,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-28 06:18:59,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:18:59,908 INFO L225 Difference]: With dead ends: 116 [2022-04-28 06:18:59,908 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 06:18:59,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:18:59,909 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:18:59,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:18:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 06:18:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 06:18:59,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:18:59,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:59,977 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:59,977 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:59,981 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 06:18:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 06:18:59,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:59,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:59,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-28 06:18:59,982 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-28 06:18:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:18:59,984 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 06:18:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 06:18:59,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:18:59,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:18:59,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:18:59,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:18:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:18:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 06:18:59,987 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 43 [2022-04-28 06:18:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:18:59,987 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 06:18:59,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 06:18:59,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 06:19:00,188 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-28 06:19:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 06:19:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 06:19:00,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:19:00,189 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:19:00,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 06:19:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:19:00,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:19:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:19:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-28 06:19:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:19:00,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978850788] [2022-04-28 06:19:01,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:19:01,471 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:19:01,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:19:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-28 06:19:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:19:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697847137] [2022-04-28 06:19:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:19:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:19:01,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:19:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759936561] [2022-04-28 06:19:01,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:19:01,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:19:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:19:01,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:19:01,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 06:19:01,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:19:01,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:19:01,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 06:19:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:19:01,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:19:02,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2022-04-28 06:19:02,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {4317#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4317#true} is VALID [2022-04-28 06:19:02,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #96#return; {4317#true} is VALID [2022-04-28 06:19:02,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret8 := main(); {4317#true} is VALID [2022-04-28 06:19:02,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {4317#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4317#true} is VALID [2022-04-28 06:19:02,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {4317#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {4317#true} ~cond := #in~cond; {4343#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:19:02,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {4343#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4347#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:19:02,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {4347#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4347#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:19:02,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4347#(not (= |assume_abort_if_not_#in~cond| 0))} {4317#true} #80#return; {4354#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 06:19:02,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {4354#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,917 INFO L272 TraceCheckUtils]: 14: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:02,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:02,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,920 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:02,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:02,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,922 INFO L272 TraceCheckUtils]: 24: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:02,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:02,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,922 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:19:02,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 06:19:02,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 06:19:02,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 10);havoc #t~post6; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 06:19:02,924 INFO L272 TraceCheckUtils]: 32: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:02,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:02,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,925 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4317#true} {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 06:19:02,925 INFO L272 TraceCheckUtils]: 37: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:02,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:02,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:02,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:02,928 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4317#true} {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 06:19:02,931 INFO L272 TraceCheckUtils]: 42: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:19:02,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:19:02,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {4457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4318#false} is VALID [2022-04-28 06:19:02,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2022-04-28 06:19:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:19:02,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:19:03,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2022-04-28 06:19:03,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {4457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4318#false} is VALID [2022-04-28 06:19:03,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:19:03,416 INFO L272 TraceCheckUtils]: 42: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:19:03,417 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4317#true} {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 06:19:03,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:03,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:03,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:03,417 INFO L272 TraceCheckUtils]: 37: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:03,419 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4317#true} {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 06:19:03,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:03,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:03,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:03,419 INFO L272 TraceCheckUtils]: 32: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:03,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 10);havoc #t~post6; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 06:19:03,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 06:19:05,427 WARN L290 TraceCheckUtils]: 29: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-28 06:19:05,428 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:05,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:05,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:05,428 INFO L272 TraceCheckUtils]: 24: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:05,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:05,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:05,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:05,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:05,434 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:05,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:05,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:05,434 INFO L272 TraceCheckUtils]: 14: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:05,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 10);havoc #t~post6; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {4317#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 06:19:05,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4317#true} {4317#true} #80#return; {4317#true} is VALID [2022-04-28 06:19:05,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:05,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 06:19:05,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 06:19:05,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {4317#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4317#true} is VALID [2022-04-28 06:19:05,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {4317#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret8 := main(); {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #96#return; {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {4317#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2022-04-28 06:19:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:19:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:19:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697847137] [2022-04-28 06:19:05,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:19:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759936561] [2022-04-28 06:19:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759936561] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 06:19:05,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:19:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-28 06:19:05,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:19:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978850788] [2022-04-28 06:19:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978850788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:19:05,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:19:05,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:19:05,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053666418] [2022-04-28 06:19:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:19:05,439 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 06:19:05,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:19:05,440 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:19:07,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:07,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:19:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:19:07,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:19:07,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:19:07,484 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:19:10,724 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-28 06:19:13,052 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-28 06:19:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:14,661 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-28 06:19:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:19:14,661 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 06:19:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:19:14,661 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:19:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:19:14,662 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:19:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:19:14,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 06:19:16,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:16,732 INFO L225 Difference]: With dead ends: 104 [2022-04-28 06:19:16,732 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 06:19:16,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:19:16,733 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:19:16,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 06:19:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 06:19:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-04-28 06:19:16,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:19:16,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:19:16,792 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:19:16,793 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:19:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:16,795 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 06:19:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 06:19:16,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:19:16,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:19:16,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-28 06:19:16,797 INFO L87 Difference]: Start difference. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-28 06:19:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:16,799 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 06:19:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 06:19:16,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:19:16,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:19:16,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:19:16,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:19:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:19:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-04-28 06:19:16,802 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 46 [2022-04-28 06:19:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:19:16,802 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-04-28 06:19:16,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:19:16,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 121 transitions. [2022-04-28 06:19:20,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 120 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-04-28 06:19:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 06:19:20,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:19:20,074 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1] [2022-04-28 06:19:20,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 06:19:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:19:20,275 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:19:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:19:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-28 06:19:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:19:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15374572] [2022-04-28 06:19:20,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:19:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 2 times [2022-04-28 06:19:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:19:20,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730972218] [2022-04-28 06:19:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:19:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:19:20,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:19:20,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361986986] [2022-04-28 06:19:20,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:19:20,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:19:20,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:19:20,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:19:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 06:19:20,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:19:20,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:19:20,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:19:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:19:20,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:19:20,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {5215#true} call ULTIMATE.init(); {5215#true} is VALID [2022-04-28 06:19:20,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#(<= ~counter~0 0)} assume true; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#(<= ~counter~0 0)} {5215#true} #96#return; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#(<= ~counter~0 0)} call #t~ret8 := main(); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {5223#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {5223#(<= ~counter~0 0)} ~cond := #in~cond; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {5223#(<= ~counter~0 0)} assume !(0 == ~cond); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(<= ~counter~0 0)} assume true; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5223#(<= ~counter~0 0)} {5223#(<= ~counter~0 0)} #80#return; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 06:19:20,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {5223#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,844 INFO L272 TraceCheckUtils]: 14: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,845 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #82#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #84#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,848 INFO L272 TraceCheckUtils]: 24: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,849 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #86#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {5257#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 06:19:20,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {5257#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {5312#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,851 INFO L272 TraceCheckUtils]: 32: Hoare triple {5312#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {5312#(<= ~counter~0 2)} ~cond := #in~cond; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {5312#(<= ~counter~0 2)} assume !(0 == ~cond); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {5312#(<= ~counter~0 2)} assume true; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,853 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5312#(<= ~counter~0 2)} {5312#(<= ~counter~0 2)} #88#return; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,854 INFO L272 TraceCheckUtils]: 37: Hoare triple {5312#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {5312#(<= ~counter~0 2)} ~cond := #in~cond; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {5312#(<= ~counter~0 2)} assume !(0 == ~cond); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {5312#(<= ~counter~0 2)} assume true; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,855 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5312#(<= ~counter~0 2)} {5312#(<= ~counter~0 2)} #90#return; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {5312#(<= ~counter~0 2)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {5312#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 06:19:20,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {5312#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5355#(<= |main_#t~post7| 2)} is VALID [2022-04-28 06:19:20,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {5355#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {5216#false} is VALID [2022-04-28 06:19:20,862 INFO L272 TraceCheckUtils]: 46: Hoare triple {5216#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {5216#false} is VALID [2022-04-28 06:19:20,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {5216#false} ~cond := #in~cond; {5216#false} is VALID [2022-04-28 06:19:20,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {5216#false} assume 0 == ~cond; {5216#false} is VALID [2022-04-28 06:19:20,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {5216#false} assume !false; {5216#false} is VALID [2022-04-28 06:19:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 06:19:20,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:19:21,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {5216#false} assume !false; {5216#false} is VALID [2022-04-28 06:19:21,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {5216#false} assume 0 == ~cond; {5216#false} is VALID [2022-04-28 06:19:21,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {5216#false} ~cond := #in~cond; {5216#false} is VALID [2022-04-28 06:19:21,197 INFO L272 TraceCheckUtils]: 46: Hoare triple {5216#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {5216#false} is VALID [2022-04-28 06:19:21,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {5383#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {5216#false} is VALID [2022-04-28 06:19:21,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {5387#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5383#(< |main_#t~post7| 10)} is VALID [2022-04-28 06:19:21,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {5387#(< ~counter~0 10)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {5387#(< ~counter~0 10)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,200 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5215#true} {5387#(< ~counter~0 10)} #90#return; {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,201 INFO L272 TraceCheckUtils]: 37: Hoare triple {5387#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,201 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5215#true} {5387#(< ~counter~0 10)} #88#return; {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,202 INFO L272 TraceCheckUtils]: 32: Hoare triple {5387#(< ~counter~0 10)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {5387#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {5430#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5387#(< ~counter~0 10)} is VALID [2022-04-28 06:19:21,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {5430#(< ~counter~0 9)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,204 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5215#true} {5430#(< ~counter~0 9)} #86#return; {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,205 INFO L272 TraceCheckUtils]: 24: Hoare triple {5430#(< ~counter~0 9)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5215#true} {5430#(< ~counter~0 9)} #84#return; {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {5430#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,220 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5215#true} {5430#(< ~counter~0 9)} #82#return; {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {5430#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {5430#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {5485#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5430#(< ~counter~0 9)} is VALID [2022-04-28 06:19:21,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {5485#(< ~counter~0 8)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5215#true} {5485#(< ~counter~0 8)} #80#return; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 06:19:21,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 06:19:21,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 06:19:21,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {5485#(< ~counter~0 8)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5215#true} is VALID [2022-04-28 06:19:21,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#(< ~counter~0 8)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#(< ~counter~0 8)} call #t~ret8 := main(); {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#(< ~counter~0 8)} {5215#true} #96#return; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#(< ~counter~0 8)} assume true; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5485#(< ~counter~0 8)} is VALID [2022-04-28 06:19:21,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {5215#true} call ULTIMATE.init(); {5215#true} is VALID [2022-04-28 06:19:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:19:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:19:21,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730972218] [2022-04-28 06:19:21,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:19:21,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361986986] [2022-04-28 06:19:21,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361986986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:19:21,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:19:21,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 06:19:21,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:19:21,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15374572] [2022-04-28 06:19:21,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15374572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:19:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:19:21,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:19:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679739400] [2022-04-28 06:19:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:19:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 06:19:21,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:19:21,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 06:19:21,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:19:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:19:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:19:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:19:21,356 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 06:19:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:23,100 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2022-04-28 06:19:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 06:19:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 06:19:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:19:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 06:19:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 06:19:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 06:19:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 06:19:23,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-04-28 06:19:23,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:23,192 INFO L225 Difference]: With dead ends: 145 [2022-04-28 06:19:23,192 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 06:19:23,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:19:23,193 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:19:23,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 139 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:19:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 06:19:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-04-28 06:19:23,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:19:23,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:19:23,297 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:19:23,298 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:19:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:23,301 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-28 06:19:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-28 06:19:23,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:19:23,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:19:23,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) Second operand 127 states. [2022-04-28 06:19:23,302 INFO L87 Difference]: Start difference. First operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) Second operand 127 states. [2022-04-28 06:19:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:19:23,305 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-28 06:19:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-28 06:19:23,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:19:23,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:19:23,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:19:23,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:19:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:19:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2022-04-28 06:19:23,331 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 50 [2022-04-28 06:19:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:19:23,332 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2022-04-28 06:19:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 06:19:23,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 149 transitions. [2022-04-28 06:19:28,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 147 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:19:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2022-04-28 06:19:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 06:19:28,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:19:28,429 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:19:28,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 06:19:28,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 06:19:28,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:19:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:19:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-28 06:19:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:19:28,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622286972] [2022-04-28 06:19:28,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:19:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 2 times [2022-04-28 06:19:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:19:28,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52851005] [2022-04-28 06:19:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:19:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:19:28,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:19:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61545089] [2022-04-28 06:19:28,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:19:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:19:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:19:28,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:19:28,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process