/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:36:39,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:36:39,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:36:39,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:36:39,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:36:39,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:36:39,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:36:39,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:36:39,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:36:39,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:36:39,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:36:39,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:36:39,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:36:39,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:36:39,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:36:39,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:36:39,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:36:39,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:36:39,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:36:39,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:36:39,500 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:36:39,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:36:39,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:36:39,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:36:39,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:36:39,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:36:39,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:36:39,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:36:39,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:36:39,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:36:39,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:36:39,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:36:39,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:36:39,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:36:39,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:36:39,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:36:39,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:36:39,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:36:39,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:36:39,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:36:39,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:36:39,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:36:39,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:36:39,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:36:39,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:36:39,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:36:39,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:36:39,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:36:39,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:36:39,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:36:39,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:36:39,551 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:36:39,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:36:39,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:36:39,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:36:39,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:39,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:36:39,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:36:39,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:36:39,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:36:39,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:36:39,554 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:36:39,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:36:39,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:36:39,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:36:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:36:39,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:36:39,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:36:39,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:36:39,796 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:36:39,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c [2022-04-27 13:36:39,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17c014af/a6a5ce6553344c9199a1bdfeeea76f85/FLAG0d8746148 [2022-04-27 13:36:40,184 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:36:40,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c [2022-04-27 13:36:40,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17c014af/a6a5ce6553344c9199a1bdfeeea76f85/FLAG0d8746148 [2022-04-27 13:36:40,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17c014af/a6a5ce6553344c9199a1bdfeeea76f85 [2022-04-27 13:36:40,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:36:40,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:36:40,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:40,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:36:40,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:36:40,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e47d2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40, skipping insertion in model container [2022-04-27 13:36:40,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:36:40,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:36:40,744 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_unwindbound5.c[537,550] [2022-04-27 13:36:40,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:40,767 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:36:40,776 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_unwindbound5.c[537,550] [2022-04-27 13:36:40,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:40,799 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:36:40,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40 WrapperNode [2022-04-27 13:36:40,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:40,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:36:40,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:36:40,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:36:40,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:36:40,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:36:40,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:36:40,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:36:40,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (1/1) ... [2022-04-27 13:36:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:40,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:40,868 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-27 13:36:40,872 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-27 13:36:40,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:36:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:36:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:36:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:36:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:36:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:36:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:36:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:36:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:36:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:36:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:36:40,944 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:36:40,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:36:41,067 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:36:41,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:36:41,074 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:36:41,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:41 BoogieIcfgContainer [2022-04-27 13:36:41,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:36:41,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:36:41,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:36:41,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:36:41,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:36:40" (1/3) ... [2022-04-27 13:36:41,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b37fcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:41, skipping insertion in model container [2022-04-27 13:36:41,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:40" (2/3) ... [2022-04-27 13:36:41,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b37fcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:41, skipping insertion in model container [2022-04-27 13:36:41,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:41" (3/3) ... [2022-04-27 13:36:41,091 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.c [2022-04-27 13:36:41,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:36:41,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:36:41,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:36:41,170 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@49e63615, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@94974c3 [2022-04-27 13:36:41,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:36:41,193 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-27 13:36:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:36:41,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:41,200 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-27 13:36:41,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:36:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:41,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080108205] [2022-04-27 13:36:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:41,355 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-27 13:36:41,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:36:41,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:36:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:41,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:36:41,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:36:41,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:36:41,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:36:41,366 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-27 13:36:41,366 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-27 13:36:41,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:36:41,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:36:41,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:36:41,367 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-27 13:36:41,367 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-27 13:36:41,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:36:41,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:36:41,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:36:41,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:36:41,368 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-27 13:36:41,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:36:41,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:36:41,369 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-27 13:36:41,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:36:41,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:36:41,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:36:41,370 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-27 13:36:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080108205] [2022-04-27 13:36:41,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080108205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:41,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:41,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:36:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621338190] [2022-04-27 13:36:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:41,378 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-27 13:36:41,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:41,382 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-27 13:36:41,403 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-27 13:36:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:36:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:36:41,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:36:41,423 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-27 13:36:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:41,640 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:36:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:36:41,640 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-27 13:36:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:41,641 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-27 13:36:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:36:41,650 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-27 13:36:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:36:41,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:36:41,778 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-27 13:36:41,786 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:36:41,786 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:36:41,788 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-27 13:36:41,791 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-27 13:36:41,792 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-27 13:36:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:36:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:36:41,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:41,824 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-27 13:36:41,825 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-27 13:36:41,826 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-27 13:36:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:41,838 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:41,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:41,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:41,840 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-27 13:36:41,841 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-27 13:36:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:41,851 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:41,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:41,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:41,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:41,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:41,853 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-27 13:36:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:36:41,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:36:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:41,856 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:36:41,857 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-27 13:36:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:36:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:36:41,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:41,858 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-27 13:36:41,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:36:41,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:36:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132619769] [2022-04-27 13:36:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:42,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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; {256#true} is VALID [2022-04-27 13:36:42,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:42,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:36:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:42,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:36:42,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:36:42,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:42,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:36:42,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:36:42,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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; {256#true} is VALID [2022-04-27 13:36:42,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:42,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:36:42,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:36:42,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#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; {256#true} is VALID [2022-04-27 13:36:42,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:36:42,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:36:42,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:36:42,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:42,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:36:42,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:42,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:42,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:42,022 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:36:42,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:36:42,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:36:42,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:36:42,027 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-27 13:36:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:42,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132619769] [2022-04-27 13:36:42,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132619769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:42,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:42,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119734572] [2022-04-27 13:36:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:42,030 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-27 13:36:42,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:42,031 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-27 13:36:42,046 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-27 13:36:42,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:42,049 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-27 13:36:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,423 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:36:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:36:42,423 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-27 13:36:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:42,424 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-27 13:36:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:42,426 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-27 13:36:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:42,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:36:42,492 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-27 13:36:42,496 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:36:42,496 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:36:42,500 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-27 13:36:42,502 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:42,502 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.1s Time] [2022-04-27 13:36:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:36:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:36:42,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:42,516 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-27 13:36:42,517 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-27 13:36:42,518 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-27 13:36:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,529 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:36:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:36:42,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:42,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:42,534 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-27 13:36:42,534 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-27 13:36:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,537 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:36:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:36:42,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:42,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:42,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:42,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:42,538 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-27 13:36:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:36:42,545 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:36:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:42,546 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:36:42,546 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-27 13:36:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:36:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:36:42,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:42,549 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-27 13:36:42,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:36:42,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:36:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:42,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609149063] [2022-04-27 13:36:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:42,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885368733] [2022-04-27 13:36:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:42,576 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-27 13:36:42,592 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-27 13:36:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:42,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:36:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:42,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:42,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:36:42,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~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; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:42,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:36:42,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {490#false} is VALID [2022-04-27 13:36:42,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:36:42,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 5);havoc #t~post7; {490#false} is VALID [2022-04-27 13:36:42,775 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {490#false} is VALID [2022-04-27 13:36:42,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:36:42,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:36:42,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:36:42,775 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-27 13:36:42,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609149063] [2022-04-27 13:36:42,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885368733] [2022-04-27 13:36:42,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885368733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:42,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:42,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:36:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434482200] [2022-04-27 13:36:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:42,777 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-27 13:36:42,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:42,778 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-27 13:36:42,793 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-27 13:36:42,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:36:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:36:42,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:36:42,795 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-27 13:36:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,878 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:36:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:36:42,878 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-27 13:36:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:42,879 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-27 13:36:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:36:42,881 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-27 13:36:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:36:42,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:36:42,941 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-27 13:36:42,943 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:36:42,943 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:36:42,943 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-27 13:36:42,944 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-27 13:36:42,945 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-27 13:36:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:36:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:36:42,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:42,953 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-27 13:36:42,953 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-27 13:36:42,953 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-27 13:36:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,955 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:36:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:42,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:42,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:42,956 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-27 13:36:42,957 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-27 13:36:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:42,958 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:36:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:42,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:42,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:42,959 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-27 13:36:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:36:42,961 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:36:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:42,961 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:36:42,961 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-27 13:36:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:36:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:42,962 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-27 13:36:42,988 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-27 13:36:43,183 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-27 13:36:43,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:36:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992287971] [2022-04-27 13:36:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(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; {757#true} is VALID [2022-04-27 13:36:43,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:36:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:43,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:43,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:36:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:36:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:43,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:43,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:43,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:36:43,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(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; {757#true} is VALID [2022-04-27 13:36:43,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:36:43,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:36:43,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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; {757#true} is VALID [2022-04-27 13:36:43,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:36:43,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:43,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:43,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:36:43,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:43,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:43,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 5);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:43,305 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {757#true} is VALID [2022-04-27 13:36:43,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:43,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:43,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:43,306 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:43,307 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:36:43,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:36:43,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:36:43,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:36:43,309 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-27 13:36:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992287971] [2022-04-27 13:36:43,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992287971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:43,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:43,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954904756] [2022-04-27 13:36:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:43,310 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-27 13:36:43,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:43,311 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-27 13:36:43,328 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-27 13:36:43,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:43,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:43,329 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-27 13:36:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:43,726 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:36:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:36:43,727 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-27 13:36:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:43,727 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-27 13:36:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:43,729 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-27 13:36:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:43,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:36:43,797 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-27 13:36:43,799 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:36:43,799 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:36:43,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:36:43,800 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-27 13:36:43,800 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-27 13:36:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:36:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:36:43,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:43,809 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-27 13:36:43,809 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-27 13:36:43,810 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-27 13:36:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:43,812 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:36:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:36:43,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:43,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:43,813 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-27 13:36:43,813 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-27 13:36:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:43,816 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:36:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:36:43,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:43,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:43,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:43,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:43,819 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-27 13:36:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:36:43,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:36:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:43,824 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:36:43,824 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-27 13:36:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:36:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:36:43,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:43,825 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-27 13:36:43,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:36:43,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:36:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:43,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81677606] [2022-04-27 13:36:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:43,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123521835] [2022-04-27 13:36:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:43,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:43,854 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-27 13:36:43,871 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-27 13:36:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:43,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:44,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:36:44,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#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; {1018#true} is VALID [2022-04-27 13:36:44,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:44,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:36:44,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:36:44,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#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; {1018#true} is VALID [2022-04-27 13:36:44,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:36:44,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:44,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:44,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:44,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:36:44,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:44,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:44,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:44,054 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:36:44,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:44,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:44,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:44,057 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:44,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(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)); {1018#true} is VALID [2022-04-27 13:36:44,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:44,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:44,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:44,063 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:44,064 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(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)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:36:44,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:36:44,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:36:44,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:36:44,065 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-27 13:36:44,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:44,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81677606] [2022-04-27 13:36:44,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:44,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123521835] [2022-04-27 13:36:44,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123521835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:44,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:44,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:36:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667601245] [2022-04-27 13:36:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:44,067 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-27 13:36:44,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:44,067 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-27 13:36:44,087 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-27 13:36:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:36:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:36:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:36:44,088 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-27 13:36:46,254 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-27 13:36:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:46,470 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 13:36:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:36:46,470 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-27 13:36:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:46,471 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-27 13:36:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:36:46,472 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-27 13:36:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:36:46,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:36:46,569 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-27 13:36:46,570 INFO L225 Difference]: With dead ends: 59 [2022-04-27 13:36:46,570 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:36:46,571 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-27 13:36:46,571 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-27 13:36:46,572 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-27 13:36:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:36:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:36:46,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:46,581 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-27 13:36:46,582 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-27 13:36:46,582 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-27 13:36:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:46,587 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:36:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:46,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:46,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:46,588 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-27 13:36:46,588 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-27 13:36:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:46,591 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:36:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:46,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:46,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:46,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:46,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:46,592 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-27 13:36:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-27 13:36:46,594 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-27 13:36:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:46,595 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-27 13:36:46,599 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-27 13:36:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:36:46,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:46,601 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-27 13:36:46,622 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-27 13:36:46,813 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-27 13:36:46,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:36:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:46,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764495966] [2022-04-27 13:36:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:46,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:46,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:46,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570682881] [2022-04-27 13:36:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:46,828 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-27 13:36:46,864 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-27 13:36:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:46,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:46,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:47,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-27 13:36:47,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#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; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} #96#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} call #t~ret8 := main(); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~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; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} ~cond := #in~cond; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} assume !(0 == ~cond); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} #80#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:47,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,102 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,104 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #82#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,104 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #84#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,106 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,112 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #86#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:47,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:36:47,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1387#false} is VALID [2022-04-27 13:36:47,113 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1387#false} is VALID [2022-04-27 13:36:47,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2022-04-27 13:36:47,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2022-04-27 13:36:47,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-27 13:36:47,114 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-27 13:36:47,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:47,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764495966] [2022-04-27 13:36:47,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570682881] [2022-04-27 13:36:47,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570682881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:47,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:47,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:36:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225811241] [2022-04-27 13:36:47,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:47,115 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-27 13:36:47,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:47,116 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-27 13:36:47,142 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-27 13:36:47,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:36:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:36:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:36:47,143 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-27 13:36:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:47,356 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-27 13:36:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:36:47,356 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-27 13:36:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:47,357 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-27 13:36:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:36:47,358 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-27 13:36:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:36:47,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:36:47,420 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-27 13:36:47,421 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:36:47,421 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:36:47,422 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-27 13:36:47,422 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-27 13:36:47,423 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-27 13:36:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:36:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:36:47,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:47,437 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-27 13:36:47,437 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-27 13:36:47,437 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-27 13:36:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:47,440 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:36:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:36:47,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:47,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:47,440 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-27 13:36:47,441 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-27 13:36:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:47,443 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:36:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:36:47,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:47,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:47,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:47,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:47,444 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-27 13:36:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-27 13:36:47,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-27 13:36:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:47,446 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-27 13:36:47,446 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-27 13:36:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-27 13:36:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:36:47,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:47,447 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-27 13:36:47,470 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-27 13:36:47,666 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-27 13:36:47,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:36:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:47,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917640883] [2022-04-27 13:36:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:47,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:47,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793816429] [2022-04-27 13:36:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:47,695 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-27 13:36:47,696 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-27 13:36:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:47,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:36:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:47,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:48,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} call ULTIMATE.init(); {1839#true} is VALID [2022-04-27 13:36:48,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#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; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} #96#return; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} call #t~ret8 := main(); {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#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; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:36:48,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} #80#return; {1839#true} is VALID [2022-04-27 13:36:48,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(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; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 5);havoc #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,319 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(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)); {1839#true} is VALID [2022-04-27 13:36:48,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:36:48,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:36:48,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:36:48,320 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,320 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(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)); {1839#true} is VALID [2022-04-27 13:36:48,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:36:48,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:36:48,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:36:48,323 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,323 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(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)); {1839#true} is VALID [2022-04-27 13:36:48,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:36:48,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:36:48,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:36:48,324 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:36:48,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1932#(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-27 13:36:48,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(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; {1932#(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-27 13:36:48,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(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 < 5);havoc #t~post7; {1932#(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-27 13:36:48,329 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(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)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:36:48,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:36:48,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1840#false} is VALID [2022-04-27 13:36:48,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} assume !false; {1840#false} is VALID [2022-04-27 13:36:48,330 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-27 13:36:48,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:48,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917640883] [2022-04-27 13:36:48,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:48,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793816429] [2022-04-27 13:36:48,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793816429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:48,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:48,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:48,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789895465] [2022-04-27 13:36:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:48,332 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-27 13:36:48,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:48,332 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-27 13:36:48,360 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-27 13:36:48,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:48,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:48,361 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-27 13:36:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:51,047 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-27 13:36:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:36:51,047 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-27 13:36:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:51,047 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-27 13:36:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:36:51,049 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-27 13:36:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:36:51,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 13:36:51,144 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-27 13:36:51,145 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:36:51,146 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:36:51,146 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-27 13:36:51,146 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-27 13:36:51,147 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-27 13:36:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:36:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:36:51,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:51,166 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-27 13:36:51,166 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-27 13:36:51,166 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-27 13:36:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:51,169 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:36:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:36:51,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:51,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:51,170 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-27 13:36:51,170 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-27 13:36:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:51,173 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:36:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:36:51,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:51,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:51,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:51,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:51,174 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-27 13:36:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-27 13:36:51,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-27 13:36:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:51,177 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-27 13:36:51,177 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-27 13:36:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-27 13:36:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:36:51,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:51,178 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-27 13:36:51,203 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-27 13:36:51,391 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-27 13:36:51,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:36:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:51,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148824933] [2022-04-27 13:36:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:51,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:51,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899215877] [2022-04-27 13:36:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:51,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:51,404 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-27 13:36:51,409 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-27 13:36:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:51,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:51,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:51,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:36:51,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~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; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} ~cond := #in~cond; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} assume !(0 == ~cond); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:51,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,694 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,696 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,697 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,698 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,699 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,701 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:36:51,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:36:51,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 5);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:36:51,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:36:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:36:51,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:36:51,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:36:51,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:36:51,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:36:51,942 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:36:51,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 5);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:36:51,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:36:51,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {2475#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:36:51,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {2479#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2475#(< |main_#t~post6| 5)} is VALID [2022-04-27 13:36:51,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {2479#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,948 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} #86#return; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:36:51,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:36:51,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:36:51,948 INFO L272 TraceCheckUtils]: 24: Hoare triple {2479#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:36:51,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} #84#return; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:36:51,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:36:51,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:36:51,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {2479#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:36:51,950 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} #82#return; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:36:51,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:36:51,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:36:51,951 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:36:51,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(< ~counter~0 5)} is VALID [2022-04-27 13:36:51,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(< ~counter~0 4)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2534#(< ~counter~0 4)} #80#return; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:36:51,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:36:51,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:36:51,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {2534#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:36:51,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(< ~counter~0 4)} 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; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {2534#(< ~counter~0 4)} call #t~ret8 := main(); {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2534#(< ~counter~0 4)} {2338#true} #96#return; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {2534#(< ~counter~0 4)} assume true; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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; {2534#(< ~counter~0 4)} is VALID [2022-04-27 13:36:51,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:36:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:36:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148824933] [2022-04-27 13:36:51,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899215877] [2022-04-27 13:36:51,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899215877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:36:51,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:36:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:36:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21913660] [2022-04-27 13:36:51,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:36:51,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:36:51,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:51,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:36:52,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:52,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:36:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:36:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:36:52,007 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:36:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:52,593 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-27 13:36:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:36:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:36:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:36:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:36:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:36:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:36:52,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 13:36:52,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:52,740 INFO L225 Difference]: With dead ends: 160 [2022-04-27 13:36:52,740 INFO L226 Difference]: Without dead ends: 146 [2022-04-27 13:36:52,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:36:52,741 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:52,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:36:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-27 13:36:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-27 13:36:52,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:52,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:36:52,798 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:36:52,804 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:36:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:52,810 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:36:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:36:52,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:52,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:52,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:36:52,813 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:36:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:52,817 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:36:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:36:52,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:52,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:52,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:52,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:36:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-27 13:36:52,824 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-27 13:36:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:52,825 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-27 13:36:52,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:36:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-27 13:36:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:36:52,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:52,826 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-27 13:36:52,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:36:53,049 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-27 13:36:53,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:36:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:53,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743426768] [2022-04-27 13:36:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:53,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:53,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769878490] [2022-04-27 13:36:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:53,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:53,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:53,066 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-27 13:36:53,090 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-27 13:36:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:53,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:36:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:53,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:54,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:36:54,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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; {3284#true} is VALID [2022-04-27 13:36:54,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:36:54,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:36:54,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#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; {3284#true} is VALID [2022-04-27 13:36:54,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:36:54,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:36:54,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:36:54,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:36:54,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} {3284#true} #80#return; {3321#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:36:54,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3321#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(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; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,205 INFO L272 TraceCheckUtils]: 14: Hoare triple {3325#(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)); {3284#true} is VALID [2022-04-27 13:36:54,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:54,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:54,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,206 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {3325#(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)); {3284#true} is VALID [2022-04-27 13:36:54,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:54,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:54,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,207 INFO L272 TraceCheckUtils]: 24: Hoare triple {3325#(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)); {3284#true} is VALID [2022-04-27 13:36:54,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:54,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:54,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,209 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:54,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {3325#(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; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:36:54,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#(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; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:36:54,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 5);havoc #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:36:54,211 INFO L272 TraceCheckUtils]: 32: Hoare triple {3380#(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)); {3284#true} is VALID [2022-04-27 13:36:54,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:54,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:54,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,212 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:36:54,212 INFO L272 TraceCheckUtils]: 37: Hoare triple {3380#(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)); {3284#true} is VALID [2022-04-27 13:36:54,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:54,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:54,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:54,213 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:36:54,216 INFO L272 TraceCheckUtils]: 42: Hoare triple {3380#(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)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:36:54,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:36:54,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:36:54,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:36:54,218 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-27 13:36:54,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:36:55,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:36:55,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:36:55,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:36:55,166 INFO L272 TraceCheckUtils]: 42: Hoare triple {3440#(= (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)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:36:55,167 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:36:55,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,167 INFO L272 TraceCheckUtils]: 37: Hoare triple {3440#(= (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)); {3284#true} is VALID [2022-04-27 13:36:55,168 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:36:55,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,168 INFO L272 TraceCheckUtils]: 32: Hoare triple {3440#(= (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)); {3284#true} is VALID [2022-04-27 13:36:55,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:36:55,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:36:55,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#(= (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; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:36:55,934 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:36:55,935 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:36:55,936 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,936 INFO L272 TraceCheckUtils]: 14: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:36:55,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:36:55,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3284#true} {3284#true} #80#return; {3284#true} is VALID [2022-04-27 13:36:55,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:36:55,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#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; {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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; {3284#true} is VALID [2022-04-27 13:36:55,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:36:55,939 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-27 13:36:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743426768] [2022-04-27 13:36:55,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769878490] [2022-04-27 13:36:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769878490] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:36:55,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:36:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:36:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868987771] [2022-04-27 13:36:55,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:55,941 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-27 13:36:55,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:55,941 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-27 13:36:57,995 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-27 13:36:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:36:57,997 INFO L87 Difference]: Start difference. First operand 138 states and 166 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-27 13:37:00,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:37:02,961 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-27 13:37:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:04,224 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-04-27 13:37:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:04,225 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-27 13:37:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:04,225 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-27 13:37:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:37:04,226 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-27 13:37:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:37:04,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:37:06,303 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-27 13:37:06,306 INFO L225 Difference]: With dead ends: 162 [2022-04-27 13:37:06,306 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 13:37:06,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:06,307 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 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.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:06,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-27 13:37:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 13:37:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-27 13:37:06,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:06,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:06,356 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:06,356 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:06,361 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:37:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:37:06,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:06,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:06,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:37:06,363 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:37:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:06,368 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:37:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:37:06,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:06,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:06,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:06,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-27 13:37:06,372 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-27 13:37:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:06,373 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-27 13:37:06,373 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-27 13:37:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-27 13:37:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:37:06,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:06,373 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-27 13:37:06,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:37:06,579 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-27 13:37:06,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-27 13:37:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:06,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769799024] [2022-04-27 13:37:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:06,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:06,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725232342] [2022-04-27 13:37:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:06,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:06,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:06,592 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-27 13:37:06,597 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-27 13:37:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:06,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:37:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:06,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:06,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:37:06,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#(<= ~counter~0 0)} {4334#true} #96#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#(<= ~counter~0 0)} call #t~ret8 := main(); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#(<= ~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; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {4342#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(<= ~counter~0 0)} ~cond := #in~cond; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(<= ~counter~0 0)} assume !(0 == ~cond); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,888 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4342#(<= ~counter~0 0)} {4342#(<= ~counter~0 0)} #80#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {4342#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:06,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {4342#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {4376#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,890 INFO L272 TraceCheckUtils]: 14: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,892 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #82#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,893 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,894 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #84#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,895 INFO L272 TraceCheckUtils]: 24: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,896 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #86#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {4376#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:06,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,898 INFO L272 TraceCheckUtils]: 32: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,900 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #88#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,900 INFO L272 TraceCheckUtils]: 37: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,901 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #90#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(<= ~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); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:06,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {4431#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4474#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:37:06,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {4474#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:37:06,903 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:37:06,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:37:06,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:37:06,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:37:06,904 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-27 13:37:06,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:07,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:37:07,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:37:07,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:37:07,149 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:37:07,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:37:07,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4502#(< |main_#t~post7| 5)} is VALID [2022-04-27 13:37:07,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(< ~counter~0 5)} 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); {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,151 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4334#true} {4506#(< ~counter~0 5)} #90#return; {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,151 INFO L272 TraceCheckUtils]: 37: Hoare triple {4506#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,152 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4334#true} {4506#(< ~counter~0 5)} #88#return; {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,152 INFO L272 TraceCheckUtils]: 32: Hoare triple {4506#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {4549#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4506#(< ~counter~0 5)} is VALID [2022-04-27 13:37:07,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {4549#(< ~counter~0 4)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,155 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} #86#return; {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,155 INFO L272 TraceCheckUtils]: 24: Hoare triple {4549#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,156 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} #84#return; {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {4549#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,157 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} #82#return; {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,157 INFO L272 TraceCheckUtils]: 14: Hoare triple {4549#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {4549#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {4431#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4549#(< ~counter~0 4)} is VALID [2022-04-27 13:37:07,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {4431#(<= ~counter~0 2)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#true} {4431#(<= ~counter~0 2)} #80#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:07,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:07,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:07,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {4431#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:07,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {4431#(<= ~counter~0 2)} 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; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {4431#(<= ~counter~0 2)} call #t~ret8 := main(); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4431#(<= ~counter~0 2)} {4334#true} #96#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:07,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:37:07,168 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-27 13:37:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769799024] [2022-04-27 13:37:07,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725232342] [2022-04-27 13:37:07,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725232342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:37:07,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:37:07,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:37:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478862439] [2022-04-27 13:37:07,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:37:07,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2022-04-27 13:37:07,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:07,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-27 13:37:07,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:37:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:37:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:37:07,233 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-27 13:37:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:09,973 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2022-04-27 13:37:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:37:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2022-04-27 13:37:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-27 13:37:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 13:37:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-27 13:37:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 13:37:09,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-27 13:37:10,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:10,109 INFO L225 Difference]: With dead ends: 234 [2022-04-27 13:37:10,109 INFO L226 Difference]: Without dead ends: 210 [2022-04-27 13:37:10,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:10,110 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:10,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 13:37:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-27 13:37:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2022-04-27 13:37:10,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:10,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 13:37:10,192 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 13:37:10,193 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 13:37:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:10,198 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-27 13:37:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-27 13:37:10,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:10,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:10,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) Second operand 210 states. [2022-04-27 13:37:10,200 INFO L87 Difference]: Start difference. First operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) Second operand 210 states. [2022-04-27 13:37:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:10,206 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-27 13:37:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-27 13:37:10,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:10,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:10,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:10,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 13:37:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2022-04-27 13:37:10,214 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 50 [2022-04-27 13:37:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:10,214 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2022-04-27 13:37:10,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-27 13:37:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2022-04-27 13:37:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:37:10,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:10,215 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-27 13:37:10,234 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-27 13:37:10,427 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-27 13:37:10,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-27 13:37:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:10,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87529250] [2022-04-27 13:37:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:10,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759311204] [2022-04-27 13:37:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:10,439 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-27 13:37:10,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process