/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-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:22:15,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:22:15,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:22:15,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:22:15,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:22:15,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:22:15,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:22:15,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:22:15,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:22:15,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:22:15,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:22:15,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:22:15,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:22:15,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:22:15,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:22:15,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:22:15,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:22:15,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:22:15,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:22:15,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:22:15,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:22:15,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:22:15,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:22:15,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:22:15,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:22:15,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:22:15,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:22:15,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:22:15,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:22:15,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:22:15,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:22:15,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:22:15,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:22:15,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:22:15,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:22:15,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:22:15,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:22:15,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:22:15,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:22:15,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:22:15,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:22:15,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:22:15,774 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:22:15,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:22:15,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:22:15,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:22:15,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:22:15,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:22:15,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:22:15,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:22:15,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:22:15,802 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:22:15,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:22:15,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:22:15,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:22:15,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:22:15,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:22:15,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:22:15,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:22:15,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:22:15,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:22:15,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:15,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:22:15,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:22:15,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:22:15,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:22:15,805 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:22:15,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:22:15,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:22:15,805 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:22:15,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:22:16,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:22:16,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:22:16,004 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:22:16,004 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:22:16,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-04-27 13:22:16,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890f67b5b/aa06fc68b36a416e94ea888049865a5e/FLAG6da0f1109 [2022-04-27 13:22:16,406 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:22:16,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-04-27 13:22:16,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890f67b5b/aa06fc68b36a416e94ea888049865a5e/FLAG6da0f1109 [2022-04-27 13:22:16,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890f67b5b/aa06fc68b36a416e94ea888049865a5e [2022-04-27 13:22:16,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:22:16,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:22:16,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:16,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:22:16,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:22:16,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe723fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16, skipping insertion in model container [2022-04-27 13:22:16,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:22:16,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:22:16,582 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-ll_unwindbound2.c[538,551] [2022-04-27 13:22:16,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:16,620 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:22:16,630 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-ll_unwindbound2.c[538,551] [2022-04-27 13:22:16,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:22:16,659 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:22:16,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16 WrapperNode [2022-04-27 13:22:16,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:22:16,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:22:16,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:22:16,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:22:16,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:22:16,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:22:16,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:22:16,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:22:16,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (1/1) ... [2022-04-27 13:22:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:22:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:16,724 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:22:16,733 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:22:16,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:22:16,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:22:16,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:22:16,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:22:16,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:22:16,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:22:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:22:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:22:16,803 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:22:16,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:22:16,970 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:22:16,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:22:16,974 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:22:16,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:16 BoogieIcfgContainer [2022-04-27 13:22:16,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:22:16,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:22:16,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:22:16,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:22:16,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:22:16" (1/3) ... [2022-04-27 13:22:16,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae14f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:16, skipping insertion in model container [2022-04-27 13:22:16,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:22:16" (2/3) ... [2022-04-27 13:22:16,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae14f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:22:16, skipping insertion in model container [2022-04-27 13:22:16,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:22:16" (3/3) ... [2022-04-27 13:22:16,980 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound2.c [2022-04-27 13:22:16,988 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:22:16,989 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:22:17,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:22:17,023 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@3688bea5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9fcd0bc [2022-04-27 13:22:17,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:22:17,031 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:22:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:17,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:17,037 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:22:17,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:22:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:17,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798503403] [2022-04-27 13:22:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,225 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:22:17,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:17,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:17,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:17,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:17,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:17,243 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:22:17,244 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:22:17,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:22:17,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:22:17,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:22:17,244 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:22:17,244 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:22:17,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:22:17,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:22:17,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:22:17,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:22:17,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:22:17,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:17,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:22:17,247 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41#false} is VALID [2022-04-27 13:22:17,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:22:17,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:22:17,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:22:17,247 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:22:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798503403] [2022-04-27 13:22:17,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798503403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:17,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:17,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:22:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348868798] [2022-04-27 13:22:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:17,255 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:22:17,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:17,258 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:22:17,287 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:22:17,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:22:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:22:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:22:17,308 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:22:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,462 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:22:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:22:17,462 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:22:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:17,463 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:22:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:17,473 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:22:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:22:17,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:22:17,571 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:22:17,590 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:22:17,590 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:22:17,592 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:22:17,595 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:17,595 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.0s Time] [2022-04-27 13:22:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:22:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:22:17,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:17,617 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:22:17,617 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:22:17,618 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:22:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,623 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:17,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:17,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:17,625 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:22:17,625 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:22:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:17,629 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:22:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:22:17,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:17,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:17,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:17,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:17,630 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:22:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:22:17,634 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:22:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:17,634 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:22:17,635 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:22:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:22:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:22:17,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:17,635 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:22:17,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:22:17,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:22:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570663158] [2022-04-27 13:22:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,755 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:22:17,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:17,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:17,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:17,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:17,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:17,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:17,766 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:22:17,766 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:22:17,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:17,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:22:17,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:22:17,766 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:22:17,767 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:22:17,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:22:17,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:22:17,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:22:17,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:22:17,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:17,768 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:22:17,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 2);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:22:17,769 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:17,770 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:22:17,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:22:17,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:22:17,773 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:22:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570663158] [2022-04-27 13:22:17,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570663158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:17,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:17,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146372591] [2022-04-27 13:22:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:17,775 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:22:17,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:17,776 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:22:17,797 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:22:17,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:17,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:17,799 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:22:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,141 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:22:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:18,142 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:22:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:18,143 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:22:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:18,149 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:22:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:18,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:18,205 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:22:18,210 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:22:18,210 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:22:18,213 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:22:18,215 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:22:18,215 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:22:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:22:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:22:18,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:18,224 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:22:18,224 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:22:18,224 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:22:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,227 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:18,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,228 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:22:18,228 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:22:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,230 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:22:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:22:18,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:18,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:18,232 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:22:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:22:18,233 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:22:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:18,234 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:22:18,234 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:22:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:22:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:22:18,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:18,237 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:22:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:22:18,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:22:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:18,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386080766] [2022-04-27 13:22:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:18,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:18,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53055912] [2022-04-27 13:22:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:18,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:18,250 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:22:18,251 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:22:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:22:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:18,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:22:18,411 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,412 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:22:18,413 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:22:18,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,415 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:22:18,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:18,416 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:22:18,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {490#false} is VALID [2022-04-27 13:22:18,416 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:22:18,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 2);havoc #t~post7; {490#false} is VALID [2022-04-27 13:22:18,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {490#false} is VALID [2022-04-27 13:22:18,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:22:18,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:22:18,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:22:18,417 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:22:18,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386080766] [2022-04-27 13:22:18,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53055912] [2022-04-27 13:22:18,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53055912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:18,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:18,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:22:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536513872] [2022-04-27 13:22:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:18,419 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:22:18,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:18,419 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:22:18,433 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:22:18,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:22:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:22:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:22:18,434 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:22:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,499 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:22:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:22:18,500 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:22:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:18,500 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:22:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:18,502 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:22:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:22:18,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:22:18,547 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:22:18,549 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:18,549 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:22:18,549 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:22:18,550 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:22:18,550 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:22:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:22:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:22:18,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:18,557 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:22:18,557 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:22:18,557 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:22:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,559 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,560 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:22:18,560 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:22:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:18,562 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:22:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:18,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:18,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:18,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:18,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:18,563 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:22:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:22:18,564 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:22:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:18,564 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:22:18,564 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:22:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:22:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:22:18,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:18,565 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:22:18,584 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:22:18,781 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:22:18,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:22:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:18,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622490958] [2022-04-27 13:22:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:22:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,870 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:22:18,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:22:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:18,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:18,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:22:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:18,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:18,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:18,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:18,892 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:22:18,892 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:22:18,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:22:18,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:22:18,892 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:22:18,893 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:22:18,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:18,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:18,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:22:18,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:18,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:18,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 2);havoc #t~post6; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:18,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {757#true} is VALID [2022-04-27 13:22:18,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:22:18,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:22:18,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:22:18,898 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-27 13:22:18,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:18,899 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:22:18,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:22:18,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:22:18,902 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:22:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:18,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622490958] [2022-04-27 13:22:18,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622490958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:18,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:18,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243212764] [2022-04-27 13:22:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:18,903 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:22:18,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:18,904 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:22:18,919 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:22:18,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:18,920 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:22:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,237 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:22:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:22:19,237 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:22:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:19,238 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:22:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:19,239 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:22:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:22:19,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:22:19,293 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:22:19,295 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:22:19,295 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:22:19,295 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:22:19,296 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:19,296 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.1s Time] [2022-04-27 13:22:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:22:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:22:19,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:19,304 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:22:19,304 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:22:19,304 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:22:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,306 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:19,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,307 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:22:19,307 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:22:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,309 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:22:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:22:19,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:19,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:19,309 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:22:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:22:19,310 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:22:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:22:19,311 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:22:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:22:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:22:19,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:19,311 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:22:19,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:22:19,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:22:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:19,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375438422] [2022-04-27 13:22:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:19,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:19,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291341948] [2022-04-27 13:22:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:19,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:19,322 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:22:19,323 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:22:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:19,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:19,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:19,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:22:19,477 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:22:19,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:19,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:22:19,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:22:19,477 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:22:19,478 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:22:19,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:19,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:19,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:19,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:22:19,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:19,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:19,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:19,479 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:19,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:19,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:19,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:19,480 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:19,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:22:19,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:22:19,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:22:19,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:22:19,482 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:19,482 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:19,483 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:22:19,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:22:19,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:22:19,483 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:22:19,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:19,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375438422] [2022-04-27 13:22:19,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:19,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291341948] [2022-04-27 13:22:19,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291341948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:19,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:19,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863179018] [2022-04-27 13:22:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:19,485 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:22:19,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:19,485 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:22:19,500 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:22:19,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:19,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:19,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:19,501 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:22:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,683 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-27 13:22:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:19,683 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:22:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:19,683 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:22:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:19,685 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:22:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-27 13:22:19,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-27 13:22:19,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:19,780 INFO L225 Difference]: With dead ends: 71 [2022-04-27 13:22:19,780 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:22:19,780 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:22:19,781 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:19,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:22:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:22:19,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:19,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,793 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,793 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,795 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:19,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,796 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:19,798 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-27 13:22:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:19,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:19,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:19,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:19,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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:22:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-27 13:22:19,800 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-27 13:22:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:19,800 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-27 13:22:19,800 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:22:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 13:22:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:19,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:19,801 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:22:19,821 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:22:20,021 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:22:20,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:22:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:20,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87082057] [2022-04-27 13:22:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:20,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:20,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286921719] [2022-04-27 13:22:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:20,034 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:22:20,043 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:22:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:20,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:20,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:20,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1403#true} call ULTIMATE.init(); {1403#true} is VALID [2022-04-27 13:22:20,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1411#(<= ~counter~0 0)} {1403#true} #96#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1411#(<= ~counter~0 0)} call #t~ret8 := main(); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#(<= ~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; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {1411#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {1411#(<= ~counter~0 0)} ~cond := #in~cond; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1411#(<= ~counter~0 0)} assume !(0 == ~cond); {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {1411#(<= ~counter~0 0)} assume true; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1411#(<= ~counter~0 0)} {1411#(<= ~counter~0 0)} #80#return; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1411#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1411#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:20,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1411#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1445#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,267 INFO L272 TraceCheckUtils]: 14: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,269 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #82#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,271 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #84#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,271 INFO L272 TraceCheckUtils]: 24: Hoare triple {1445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {1445#(<= ~counter~0 1)} ~cond := #in~cond; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(<= ~counter~0 1)} assume !(0 == ~cond); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {1445#(<= ~counter~0 1)} assume true; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,273 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1445#(<= ~counter~0 1)} {1445#(<= ~counter~0 1)} #86#return; {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {1445#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1445#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:20,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {1445#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1500#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:22:20,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {1500#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1404#false} is VALID [2022-04-27 13:22:20,274 INFO L272 TraceCheckUtils]: 32: Hoare triple {1404#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1404#false} is VALID [2022-04-27 13:22:20,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {1404#false} ~cond := #in~cond; {1404#false} is VALID [2022-04-27 13:22:20,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {1404#false} assume 0 == ~cond; {1404#false} is VALID [2022-04-27 13:22:20,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {1404#false} assume !false; {1404#false} is VALID [2022-04-27 13:22:20,274 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:22:20,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:20,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87082057] [2022-04-27 13:22:20,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:20,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286921719] [2022-04-27 13:22:20,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286921719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:20,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:20,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098671076] [2022-04-27 13:22:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:20,276 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:22:20,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:20,276 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:22:20,300 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:22:20,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:20,301 INFO L87 Difference]: Start difference. First operand 56 states and 70 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:22:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,401 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-27 13:22:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:20,401 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:22:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:20,402 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:22:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:20,403 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:22:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:22:20,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:22:20,439 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:22:20,441 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:22:20,441 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:22:20,441 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:22:20,441 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:22:20,442 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:22:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:22:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:22:20,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:20,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,452 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,453 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,454 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:20,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,455 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:20,457 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-27 13:22:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-27 13:22:20,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:20,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:20,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:20,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 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:22:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-27 13:22:20,459 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-27 13:22:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:20,459 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-27 13:22:20,460 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:22:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 13:22:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:22:20,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:20,460 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:22:20,481 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:22:20,675 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:22:20,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:22:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:20,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739791795] [2022-04-27 13:22:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:20,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:20,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228843083] [2022-04-27 13:22:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:20,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:20,689 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:22:20,690 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:22:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:20,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:22:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:20,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:21,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #96#return; {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret8 := main(); {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#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; {1856#true} is VALID [2022-04-27 13:22:21,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {1856#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:21,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:21,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:21,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:21,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1856#true} {1856#true} #80#return; {1856#true} is VALID [2022-04-27 13:22:21,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,228 INFO L272 TraceCheckUtils]: 14: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:21,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:21,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:21,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:21,231 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:21,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:21,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:21,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:21,232 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1856#true} is VALID [2022-04-27 13:22:21,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#true} ~cond := #in~cond; {1856#true} is VALID [2022-04-27 13:22:21,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#true} assume !(0 == ~cond); {1856#true} is VALID [2022-04-27 13:22:21,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {1856#true} assume true; {1856#true} is VALID [2022-04-27 13:22:21,233 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1856#true} {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {1894#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 13:22:21,238 INFO L272 TraceCheckUtils]: 32: Hoare triple {1949#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:21,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {1959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:21,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1857#false} is VALID [2022-04-27 13:22:21,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2022-04-27 13:22:21,239 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:22:21,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:21,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739791795] [2022-04-27 13:22:21,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:21,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228843083] [2022-04-27 13:22:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228843083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:22:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600749718] [2022-04-27 13:22:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:21,240 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:22:21,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:21,241 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:22:21,259 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:22:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:22:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:22:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:21,261 INFO L87 Difference]: Start difference. First operand 68 states and 78 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:22:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:21,533 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-27 13:22:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:22:21,533 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:22:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:21,533 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:22:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:21,534 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:22:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 13:22:21,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 13:22:21,587 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:22:21,588 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:22:21,588 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 13:22:21,589 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:22:21,589 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:21,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 13:22:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 13:22:21,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:21,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:21,609 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:21,609 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:21,611 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:21,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:21,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:21,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:21,611 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 58 states. [2022-04-27 13:22:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:21,613 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 13:22:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:21,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:21,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:21,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:21,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 13:22:21,615 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 36 [2022-04-27 13:22:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:21,615 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 13:22:21,615 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:22:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 13:22:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:22:21,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:21,616 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:22:21,637 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:22:21,827 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:22:21,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:22:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095224783] [2022-04-27 13:22:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:21,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:21,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695665494] [2022-04-27 13:22:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:21,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:21,839 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:22:21,854 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:22:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:21,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:21,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:22,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:22,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#(<= ~counter~0 0)} {2274#true} #96#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#(<= ~counter~0 0)} call #t~ret8 := main(); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#(<= ~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; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {2282#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#(<= ~counter~0 0)} ~cond := #in~cond; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#(<= ~counter~0 0)} assume !(0 == ~cond); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2282#(<= ~counter~0 0)} {2282#(<= ~counter~0 0)} #80#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,068 INFO L272 TraceCheckUtils]: 14: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,069 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #82#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #84#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,072 INFO L272 TraceCheckUtils]: 24: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {2316#(<= ~counter~0 1)} ~cond := #in~cond; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {2316#(<= ~counter~0 1)} assume !(0 == ~cond); {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(<= ~counter~0 1)} assume true; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,073 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2316#(<= ~counter~0 1)} {2316#(<= ~counter~0 1)} #86#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {2316#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {2316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2371#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {2371#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 2);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:22,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:22,075 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:22:22,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:22,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 13:22:22,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {2275#false} assume 0 == ~cond; {2275#false} is VALID [2022-04-27 13:22:22,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {2275#false} ~cond := #in~cond; {2275#false} is VALID [2022-04-27 13:22:22,259 INFO L272 TraceCheckUtils]: 34: Hoare triple {2275#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2275#false} is VALID [2022-04-27 13:22:22,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {2275#false} assume !(#t~post7 < 2);havoc #t~post7; {2275#false} is VALID [2022-04-27 13:22:22,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {2275#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2275#false} is VALID [2022-04-27 13:22:22,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {2371#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2275#false} is VALID [2022-04-27 13:22:22,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {2316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2371#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:22:22,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {2316#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,264 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2274#true} {2316#(<= ~counter~0 1)} #86#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:22,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:22,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:22,265 INFO L272 TraceCheckUtils]: 24: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:22,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2274#true} {2316#(<= ~counter~0 1)} #84#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:22,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:22,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:22,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:22,267 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2274#true} {2316#(<= ~counter~0 1)} #82#return; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:22,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:22,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:22,267 INFO L272 TraceCheckUtils]: 14: Hoare triple {2316#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:22,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2316#(<= ~counter~0 1)} is VALID [2022-04-27 13:22:22,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2274#true} {2282#(<= ~counter~0 0)} #80#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 13:22:22,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2274#true} assume !(0 == ~cond); {2274#true} is VALID [2022-04-27 13:22:22,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#true} ~cond := #in~cond; {2274#true} is VALID [2022-04-27 13:22:22,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {2282#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2274#true} is VALID [2022-04-27 13:22:22,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#(<= ~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; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {2282#(<= ~counter~0 0)} call #t~ret8 := main(); {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2282#(<= ~counter~0 0)} {2274#true} #96#return; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#(<= ~counter~0 0)} assume true; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2282#(<= ~counter~0 0)} is VALID [2022-04-27 13:22:22,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2274#true} is VALID [2022-04-27 13:22:22,273 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:22:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:22,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095224783] [2022-04-27 13:22:22,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:22,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695665494] [2022-04-27 13:22:22,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695665494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:22,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 13:22:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298444657] [2022-04-27 13:22:22,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:22,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 38 [2022-04-27 13:22:22,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:22,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:22:22,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:22,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:22,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:22,322 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:22:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,449 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-04-27 13:22:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:22:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 38 [2022-04-27 13:22:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:22:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-27 13:22:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:22:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-27 13:22:22,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-27 13:22:22,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:22,505 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:22:22,505 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 13:22:22,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:22:22,505 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:22,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 13:22:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 13:22:22,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:22,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:22,527 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:22,527 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,529 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 13:22:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-27 13:22:22,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:22,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:22,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-27 13:22:22,529 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-27 13:22:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:22,531 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-27 13:22:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-27 13:22:22,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:22,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:22,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:22,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:22:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-04-27 13:22:22,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 38 [2022-04-27 13:22:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:22,533 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-04-27 13:22:22,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:22:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-27 13:22:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:22:22,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:22,533 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:22:22,551 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:22:22,749 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:22:22,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:22,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:22:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:22,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818675429] [2022-04-27 13:22:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:22,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850363315] [2022-04-27 13:22:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:22,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:22,761 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:22:22,762 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:22:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:22,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:22:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:23,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {2817#true} call ULTIMATE.init(); {2817#true} is VALID [2022-04-27 13:22:23,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {2817#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2817#true} is VALID [2022-04-27 13:22:23,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2817#true} {2817#true} #96#return; {2817#true} is VALID [2022-04-27 13:22:23,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {2817#true} call #t~ret8 := main(); {2817#true} is VALID [2022-04-27 13:22:23,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {2817#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; {2817#true} is VALID [2022-04-27 13:22:23,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {2817#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {2817#true} ~cond := #in~cond; {2843#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:22:23,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2847#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:23,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2847#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:22:23,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2847#(not (= |assume_abort_if_not_#in~cond| 0))} {2817#true} #80#return; {2854#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:22:23,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2854#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,525 INFO L272 TraceCheckUtils]: 14: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,525 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2817#true} {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,526 INFO L272 TraceCheckUtils]: 19: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,526 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2817#true} {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,526 INFO L272 TraceCheckUtils]: 24: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,528 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2817#true} {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-27 13:22:23,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {2858#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 2);havoc #t~post6; {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,530 INFO L272 TraceCheckUtils]: 32: Hoare triple {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,532 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2817#true} {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,532 INFO L272 TraceCheckUtils]: 37: Hoare triple {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,532 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2817#true} {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,533 INFO L272 TraceCheckUtils]: 42: Hoare triple {2913#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:23,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:23,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {2957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2818#false} is VALID [2022-04-27 13:22:23,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {2818#false} assume !false; {2818#false} is VALID [2022-04-27 13:22:23,534 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:22:23,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:23,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {2818#false} assume !false; {2818#false} is VALID [2022-04-27 13:22:23,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {2957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2818#false} is VALID [2022-04-27 13:22:23,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:23,850 INFO L272 TraceCheckUtils]: 42: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:23,850 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2817#true} {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,851 INFO L272 TraceCheckUtils]: 37: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,851 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2817#true} {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,852 INFO L272 TraceCheckUtils]: 32: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 2);havoc #t~post6; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2817#true} {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2817#true} {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,856 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2817#true} {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,856 INFO L272 TraceCheckUtils]: 14: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 2);havoc #t~post6; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2817#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2973#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:22:23,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2817#true} {2817#true} #80#return; {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {2817#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {2817#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; {2817#true} is VALID [2022-04-27 13:22:23,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2817#true} call #t~ret8 := main(); {2817#true} is VALID [2022-04-27 13:22:23,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2817#true} {2817#true} #96#return; {2817#true} is VALID [2022-04-27 13:22:23,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-27 13:22:23,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {2817#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2817#true} is VALID [2022-04-27 13:22:23,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {2817#true} call ULTIMATE.init(); {2817#true} is VALID [2022-04-27 13:22:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:22:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818675429] [2022-04-27 13:22:23,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850363315] [2022-04-27 13:22:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850363315] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:22:23,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:22:23,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:22:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247275426] [2022-04-27 13:22:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:23,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-27 13:22:23,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:23,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:23,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:23,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:23,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:23,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:22:23,883 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,100 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 13:22:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-27 13:22:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:22:24,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:22:24,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:24,156 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:22:24,156 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 13:22:24,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:22:24,156 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:24,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:22:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 13:22:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-04-27 13:22:24,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:24,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:24,176 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:24,176 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,178 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-27 13:22:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-27 13:22:24,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:24,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:24,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 71 states. [2022-04-27 13:22:24,178 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 71 states. [2022-04-27 13:22:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:24,180 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-27 13:22:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-27 13:22:24,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:24,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:24,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:24,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:22:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-27 13:22:24,185 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 46 [2022-04-27 13:22:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:24,185 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-27 13:22:24,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 13:22:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 13:22:24,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:24,186 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:24,204 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:22:24,399 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:22:24,399 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 243046571, now seen corresponding path program 1 times [2022-04-27 13:22:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:24,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798333149] [2022-04-27 13:22:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:24,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:24,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546913620] [2022-04-27 13:22:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:24,415 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:22:24,416 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:22:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:24,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:22:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:22:24,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:22:26,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {3445#true} call ULTIMATE.init(); {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3445#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3445#true} {3445#true} #96#return; {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {3445#true} call #t~ret8 := main(); {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3445#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; {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {3445#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3445#true} {3445#true} #80#return; {3445#true} is VALID [2022-04-27 13:22:26,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {3445#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,864 INFO L272 TraceCheckUtils]: 14: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,885 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,885 INFO L272 TraceCheckUtils]: 19: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,900 INFO L272 TraceCheckUtils]: 24: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,901 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,902 INFO L272 TraceCheckUtils]: 32: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,903 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,903 INFO L272 TraceCheckUtils]: 37: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,904 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,904 INFO L272 TraceCheckUtils]: 42: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3445#true} is VALID [2022-04-27 13:22:26,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {3445#true} ~cond := #in~cond; {3445#true} is VALID [2022-04-27 13:22:26,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {3445#true} assume !(0 == ~cond); {3445#true} is VALID [2022-04-27 13:22:26,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {3445#true} assume true; {3445#true} is VALID [2022-04-27 13:22:26,904 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3445#true} {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 2);havoc #t~post7; {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:22:26,906 INFO L272 TraceCheckUtils]: 50: Hoare triple {3483#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:26,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:26,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3446#false} is VALID [2022-04-27 13:22:26,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {3446#false} assume !false; {3446#false} is VALID [2022-04-27 13:22:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-27 13:22:26,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:22:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:26,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798333149] [2022-04-27 13:22:26,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:26,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546913620] [2022-04-27 13:22:26,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546913620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:22:26,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:22:26,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:22:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079080771] [2022-04-27 13:22:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:22:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-04-27 13:22:26,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:26,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:26,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:26,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:22:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:22:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:22:26,929 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:27,119 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-27 13:22:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:22:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-04-27 13:22:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 13:22:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 13:22:27,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-27 13:22:27,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:27,175 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:22:27,175 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 13:22:27,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:22:27,175 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:27,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:22:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 13:22:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-27 13:22:27,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:27,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:22:27,195 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:22:27,195 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:22:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:27,198 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-27 13:22:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 13:22:27,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:27,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:27,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 80 states. [2022-04-27 13:22:27,198 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 80 states. [2022-04-27 13:22:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:27,200 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-27 13:22:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 13:22:27,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:27,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:27,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:27,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:22:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-27 13:22:27,201 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 54 [2022-04-27 13:22:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:27,202 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-27 13:22:27,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:22:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:22:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 13:22:27,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:22:27,202 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:27,221 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:22:27,421 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:22:27,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:22:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:22:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 1 times [2022-04-27 13:22:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:22:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561397781] [2022-04-27 13:22:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:22:27,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:22:27,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115085214] [2022-04-27 13:22:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:22:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:22:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:22:27,431 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:22:27,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:22:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:22:27,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:22:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:22:27,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:22:27,502 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:22:27,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:22:27,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:22:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:22:27,724 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:22:27,726 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:22:27,771 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-27 13:22:27,772 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:22:27,773 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:22:27,774 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:22:27,774 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:22:27,774 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:22:27,774 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:22:27,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:22:27 BoogieIcfgContainer [2022-04-27 13:22:27,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:22:27,775 INFO L158 Benchmark]: Toolchain (without parser) took 11348.91ms. Allocated memory was 188.7MB in the beginning and 294.6MB in the end (delta: 105.9MB). Free memory was 133.6MB in the beginning and 222.9MB in the end (delta: -89.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-27 13:22:27,775 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:22:27,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.62ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 162.7MB in the end (delta: -29.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 13:22:27,776 INFO L158 Benchmark]: Boogie Preprocessor took 38.27ms. Allocated memory is still 188.7MB. Free memory was 162.7MB in the beginning and 161.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:22:27,776 INFO L158 Benchmark]: RCFGBuilder took 276.47ms. Allocated memory is still 188.7MB. Free memory was 161.4MB in the beginning and 149.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:22:27,776 INFO L158 Benchmark]: TraceAbstraction took 10797.79ms. Allocated memory was 188.7MB in the beginning and 294.6MB in the end (delta: 105.9MB). Free memory was 149.1MB in the beginning and 222.9MB in the end (delta: -73.8MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2022-04-27 13:22:27,776 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.62ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 162.7MB in the end (delta: -29.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.27ms. Allocated memory is still 188.7MB. Free memory was 162.7MB in the beginning and 161.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.47ms. Allocated memory is still 188.7MB. Free memory was 161.4MB in the beginning and 149.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10797.79ms. Allocated memory was 188.7MB in the beginning and 294.6MB in the end (delta: 105.9MB). Free memory was 149.1MB in the beginning and 222.9MB in the end (delta: -73.8MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=6, counter=0] [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L12] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) VAL [\old(counter)=0, A=1, B=1, counter=0] [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [\old(counter)=0, A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L35] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=1] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [\old(counter)=0, A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L35] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=1] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L39] COND TRUE !(r >= d) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L45] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=3, counter++=2, d=2, p=2, q=0, r=1] [L45] COND FALSE !(counter++<2) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 1149 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 741 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 408 mSDtfsCounter, 494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166 SizeOfPredicates, 11 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 265/274 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:22:27,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...