/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/divbin.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:48:35,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:48:35,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:48:35,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:48:35,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:48:35,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:48:35,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:48:35,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:48:35,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:48:35,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:48:35,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:48:35,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:48:35,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:48:35,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:48:35,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:48:35,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:48:35,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:48:35,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:48:35,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:48:35,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:48:35,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:48:35,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:48:35,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:48:35,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:48:35,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:48:35,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:48:35,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:48:35,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:48:35,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:48:35,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:48:35,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:48:35,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:48:35,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:48:35,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:48:35,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:48:35,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:48:35,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:48:35,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:48:35,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:48:35,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:48:35,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:48:35,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:48:35,701 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 11:48:35,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:48:35,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:48:35,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:48:35,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:48:35,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:48:35,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:48:35,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:48:35,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:48:35,735 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:48:35,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:48:35,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:48:35,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:48:35,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:48:35,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:48:35,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:48:35,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:48:35,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:48:35,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:48:35,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:48:35,739 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:48:35,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:48:35,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:48:35,739 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 11:48:35,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:48:35,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:48:35,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:48:35,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:48:35,960 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:48:35,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-27 11:48:36,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce52f4095/72e3cd407e22470295d179515b530bfe/FLAG31828aff8 [2022-04-27 11:48:36,440 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:48:36,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-27 11:48:36,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce52f4095/72e3cd407e22470295d179515b530bfe/FLAG31828aff8 [2022-04-27 11:48:36,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce52f4095/72e3cd407e22470295d179515b530bfe [2022-04-27 11:48:36,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:48:36,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:48:36,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:48:36,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:48:36,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:48:36,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd6a0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36, skipping insertion in model container [2022-04-27 11:48:36,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:48:36,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:48:36,627 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/divbin.i[950,963] [2022-04-27 11:48:36,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:48:36,647 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:48:36,658 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/divbin.i[950,963] [2022-04-27 11:48:36,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:48:36,674 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:48:36,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36 WrapperNode [2022-04-27 11:48:36,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:48:36,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:48:36,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:48:36,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:48:36,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:48:36,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:48:36,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:48:36,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:48:36,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (1/1) ... [2022-04-27 11:48:36,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:48:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:36,744 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 11:48:36,768 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 11:48:36,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:48:36,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:48:36,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:48:36,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:48:36,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:48:36,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:48:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:48:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:48:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:48:36,876 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:48:36,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:48:36,986 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:48:36,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:48:36,992 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:48:36,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:48:36 BoogieIcfgContainer [2022-04-27 11:48:36,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:48:36,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:48:36,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:48:36,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:48:36,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:48:36" (1/3) ... [2022-04-27 11:48:36,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e785e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:48:36, skipping insertion in model container [2022-04-27 11:48:36,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:48:36" (2/3) ... [2022-04-27 11:48:37,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e785e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:48:37, skipping insertion in model container [2022-04-27 11:48:37,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:48:36" (3/3) ... [2022-04-27 11:48:37,001 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin.i [2022-04-27 11:48:37,013 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:48:37,013 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:48:37,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:48:37,058 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@70b19d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50a80195 [2022-04-27 11:48:37,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:48:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:48:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:48:37,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:37,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:48:37,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1345265538, now seen corresponding path program 1 times [2022-04-27 11:48:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154995412] [2022-04-27 11:48:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:48:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {34#true} is VALID [2022-04-27 11:48:37,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 11:48:37,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-27 11:48:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:48:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:48:37,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:48:37,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:48:37,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #79#return; {35#false} is VALID [2022-04-27 11:48:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:48:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:48:37,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:48:37,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:48:37,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #81#return; {35#false} is VALID [2022-04-27 11:48:37,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:48:37,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {34#true} is VALID [2022-04-27 11:48:37,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 11:48:37,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-27 11:48:37,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret3 := main(); {34#true} is VALID [2022-04-27 11:48:37,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2022-04-27 11:48:37,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {34#true} is VALID [2022-04-27 11:48:37,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:48:37,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:48:37,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:48:37,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #79#return; {35#false} is VALID [2022-04-27 11:48:37,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-27 11:48:37,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:48:37,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:48:37,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:48:37,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35#false} {35#false} #81#return; {35#false} is VALID [2022-04-27 11:48:37,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {35#false} is VALID [2022-04-27 11:48:37,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 11:48:37,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 11:48:37,338 INFO L272 TraceCheckUtils]: 19: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {35#false} is VALID [2022-04-27 11:48:37,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 11:48:37,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 11:48:37,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 11:48:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:48:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:48:37,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154995412] [2022-04-27 11:48:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154995412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:48:37,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:48:37,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:48:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188758246] [2022-04-27 11:48:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:48:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 11:48:37,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:48:37,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:48:37,394 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 11:48:37,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:48:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:48:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:48:37,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:48:37,420 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:48:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:37,580 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 11:48:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:48:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 11:48:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:48:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:48:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 11:48:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:48:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-27 11:48:37,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-27 11:48:37,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:37,717 INFO L225 Difference]: With dead ends: 55 [2022-04-27 11:48:37,717 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:48:37,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:48:37,725 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:48:37,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:48:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:48:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 11:48:37,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:48:37,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:48:37,758 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:48:37,758 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:48:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:37,764 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 11:48:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:48:37,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:37,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:37,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 11:48:37,766 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 11:48:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:37,770 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 11:48:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:48:37,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:37,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:37,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:48:37,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:48:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:48:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-27 11:48:37,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2022-04-27 11:48:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:48:37,774 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-27 11:48:37,775 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:48:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:48:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:48:37,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:37,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:48:37,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:48:37,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1801528411, now seen corresponding path program 1 times [2022-04-27 11:48:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:37,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831577731] [2022-04-27 11:48:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:37,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:48:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754920389] [2022-04-27 11:48:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:37,814 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 11:48:37,816 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 11:48:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:48:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:37,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:48:38,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2022-04-27 11:48:38,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {211#true} is VALID [2022-04-27 11:48:38,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-27 11:48:38,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} #87#return; {211#true} is VALID [2022-04-27 11:48:38,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} call #t~ret3 := main(); {211#true} is VALID [2022-04-27 11:48:38,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {211#true} is VALID [2022-04-27 11:48:38,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {211#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {211#true} is VALID [2022-04-27 11:48:38,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} ~cond := #in~cond; {237#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:48:38,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {241#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:38,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {241#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:38,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {241#(not (= |assume_abort_if_not_#in~cond| 0))} {211#true} #79#return; {248#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 11:48:38,844 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {211#true} is VALID [2022-04-27 11:48:38,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#true} ~cond := #in~cond; {211#true} is VALID [2022-04-27 11:48:38,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#true} assume !(0 == ~cond); {211#true} is VALID [2022-04-27 11:48:38,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-27 11:48:38,855 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211#true} {248#(< (mod main_~B~0 4294967296) 2147483647)} #81#return; {248#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 11:48:38,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 11:48:38,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !false; {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 11:48:38,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 11:48:38,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !false; {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 11:48:38,864 INFO L272 TraceCheckUtils]: 20: Hoare triple {274#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:48:38,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:38,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {212#false} is VALID [2022-04-27 11:48:38,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-27 11:48:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:48:38,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:48:39,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-27 11:48:39,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {212#false} is VALID [2022-04-27 11:48:39,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:39,455 INFO L272 TraceCheckUtils]: 20: Hoare triple {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:48:39,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:39,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {301#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:39,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 11:48:39,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {211#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {308#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 11:48:39,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211#true} {211#true} #81#return; {211#true} is VALID [2022-04-27 11:48:39,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-27 11:48:39,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#true} assume !(0 == ~cond); {211#true} is VALID [2022-04-27 11:48:39,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#true} ~cond := #in~cond; {211#true} is VALID [2022-04-27 11:48:39,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {211#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {211#true} is VALID [2022-04-27 11:48:39,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {211#true} {211#true} #79#return; {211#true} is VALID [2022-04-27 11:48:39,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-27 11:48:39,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#true} assume !(0 == ~cond); {211#true} is VALID [2022-04-27 11:48:39,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} ~cond := #in~cond; {211#true} is VALID [2022-04-27 11:48:39,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {211#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {211#true} is VALID [2022-04-27 11:48:39,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {211#true} is VALID [2022-04-27 11:48:39,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} call #t~ret3 := main(); {211#true} is VALID [2022-04-27 11:48:39,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} #87#return; {211#true} is VALID [2022-04-27 11:48:39,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-27 11:48:39,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {211#true} is VALID [2022-04-27 11:48:39,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2022-04-27 11:48:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:48:39,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:48:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831577731] [2022-04-27 11:48:39,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:48:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754920389] [2022-04-27 11:48:39,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754920389] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:48:39,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:48:39,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 11:48:39,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907582675] [2022-04-27 11:48:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:48:39,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 11:48:39,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:48:39,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:39,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:39,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:48:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:48:39,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:48:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:48:39,489 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:42,238 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-27 11:48:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:48:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 11:48:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:48:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 11:48:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 11:48:42,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-27 11:48:42,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:42,285 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:48:42,285 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 11:48:42,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:48:42,286 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:48:42,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:48:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 11:48:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 11:48:42,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:48:42,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:42,292 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:42,293 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:42,294 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 11:48:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 11:48:42,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:42,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:42,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 11:48:42,296 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 11:48:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:42,297 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 11:48:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 11:48:42,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:42,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:42,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:48:42,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:48:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-27 11:48:42,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2022-04-27 11:48:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:48:42,300 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-27 11:48:42,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 11:48:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:48:42,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:42,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:48:42,342 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 11:48:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:42,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 262955552, now seen corresponding path program 1 times [2022-04-27 11:48:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:42,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307271160] [2022-04-27 11:48:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:42,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:48:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512905232] [2022-04-27 11:48:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:42,538 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 11:48:42,539 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 11:48:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:42,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:48:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:42,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:48:43,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2022-04-27 11:48:43,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {539#true} is VALID [2022-04-27 11:48:43,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 11:48:43,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #87#return; {539#true} is VALID [2022-04-27 11:48:43,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret3 := main(); {539#true} is VALID [2022-04-27 11:48:43,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {539#true} is VALID [2022-04-27 11:48:43,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {539#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {539#true} is VALID [2022-04-27 11:48:43,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} ~cond := #in~cond; {539#true} is VALID [2022-04-27 11:48:43,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} assume !(0 == ~cond); {539#true} is VALID [2022-04-27 11:48:43,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 11:48:43,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {539#true} {539#true} #79#return; {539#true} is VALID [2022-04-27 11:48:43,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {539#true} is VALID [2022-04-27 11:48:43,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#true} ~cond := #in~cond; {580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:48:43,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:43,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {584#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {584#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:43,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {584#(not (= |assume_abort_if_not_#in~cond| 0))} {539#true} #81#return; {591#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 11:48:43,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {591#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:48:43,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {602#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:48:43,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:43,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {540#false} is VALID [2022-04-27 11:48:43,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-27 11:48:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:48:43,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:48:44,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-27 11:48:44,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {540#false} is VALID [2022-04-27 11:48:44,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:44,020 INFO L272 TraceCheckUtils]: 22: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:48:44,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 11:48:44,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 11:48:44,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 11:48:44,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {635#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 11:48:44,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !false; {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 11:48:44,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {648#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 11:48:44,037 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {539#true} {539#true} #81#return; {539#true} is VALID [2022-04-27 11:48:44,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 11:48:44,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#true} assume !(0 == ~cond); {539#true} is VALID [2022-04-27 11:48:44,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#true} ~cond := #in~cond; {539#true} is VALID [2022-04-27 11:48:44,038 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {539#true} is VALID [2022-04-27 11:48:44,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {539#true} {539#true} #79#return; {539#true} is VALID [2022-04-27 11:48:44,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 11:48:44,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} assume !(0 == ~cond); {539#true} is VALID [2022-04-27 11:48:44,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} ~cond := #in~cond; {539#true} is VALID [2022-04-27 11:48:44,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {539#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {539#true} is VALID [2022-04-27 11:48:44,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {539#true} is VALID [2022-04-27 11:48:44,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret3 := main(); {539#true} is VALID [2022-04-27 11:48:44,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #87#return; {539#true} is VALID [2022-04-27 11:48:44,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 11:48:44,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {539#true} is VALID [2022-04-27 11:48:44,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2022-04-27 11:48:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:48:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:48:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307271160] [2022-04-27 11:48:44,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:48:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512905232] [2022-04-27 11:48:44,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512905232] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:48:44,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:48:44,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 11:48:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352681720] [2022-04-27 11:48:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:48:44,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 11:48:44,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:48:44,042 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), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:44,292 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 11:48:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:48:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:48:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:48:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:48:44,293 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:44,452 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 11:48:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:48:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 11:48:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:48:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 11:48:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 11:48:44,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 11:48:46,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:46,508 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:48:46,508 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 11:48:46,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:48:46,510 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:48:46,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-27 11:48:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 11:48:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 11:48:46,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:48:46,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:48:46,518 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:48:46,519 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:48:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:46,521 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 11:48:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 11:48:46,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:46,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-27 11:48:46,523 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-27 11:48:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:46,525 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 11:48:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 11:48:46,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:46,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:46,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:48:46,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:48:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:48:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-27 11:48:46,528 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2022-04-27 11:48:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:48:46,528 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-27 11:48:46,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:48:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 11:48:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:48:46,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:46,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:48:46,551 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 11:48:46,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 11:48:46,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash -26799507, now seen corresponding path program 1 times [2022-04-27 11:48:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:46,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937550928] [2022-04-27 11:48:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:46,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:48:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482990479] [2022-04-27 11:48:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:46,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:46,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:46,749 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 11:48:46,772 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 11:48:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:46,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:48:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:46,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:48:47,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2022-04-27 11:48:47,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {905#true} is VALID [2022-04-27 11:48:47,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:47,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #87#return; {905#true} is VALID [2022-04-27 11:48:47,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret3 := main(); {905#true} is VALID [2022-04-27 11:48:47,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {905#true} is VALID [2022-04-27 11:48:47,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {905#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:47,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#true} ~cond := #in~cond; {905#true} is VALID [2022-04-27 11:48:47,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(0 == ~cond); {905#true} is VALID [2022-04-27 11:48:47,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:47,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {905#true} {905#true} #79#return; {905#true} is VALID [2022-04-27 11:48:47,238 INFO L272 TraceCheckUtils]: 11: Hoare triple {905#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:47,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#true} ~cond := #in~cond; {905#true} is VALID [2022-04-27 11:48:47,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#true} assume !(0 == ~cond); {905#true} is VALID [2022-04-27 11:48:47,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:47,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {905#true} {905#true} #81#return; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {905#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {905#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {905#true} is VALID [2022-04-27 11:48:47,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:47,239 INFO L272 TraceCheckUtils]: 22: Hoare triple {905#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:47,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {905#true} ~cond := #in~cond; {979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:47,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:48:47,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:48:47,242 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} {905#true} #83#return; {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:47,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:47,243 INFO L272 TraceCheckUtils]: 28: Hoare triple {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {997#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 11:48:47,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {997#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1001#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 11:48:47,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {906#false} is VALID [2022-04-27 11:48:47,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {906#false} assume !false; {906#false} is VALID [2022-04-27 11:48:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:48:47,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:48:48,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {906#false} assume !false; {906#false} is VALID [2022-04-27 11:48:48,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {1011#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {906#false} is VALID [2022-04-27 11:48:48,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1011#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:48:48,618 INFO L272 TraceCheckUtils]: 28: Hoare triple {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:48:48,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:48,620 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} {905#true} #83#return; {990#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 11:48:48,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:48:48,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {1033#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:48:48,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {905#true} ~cond := #in~cond; {1033#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:48:48,621 INFO L272 TraceCheckUtils]: 22: Hoare triple {905#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:48,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {905#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {905#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {905#true} assume !false; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {905#true} {905#true} #81#return; {905#true} is VALID [2022-04-27 11:48:48,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:48,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#true} assume !(0 == ~cond); {905#true} is VALID [2022-04-27 11:48:48,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#true} ~cond := #in~cond; {905#true} is VALID [2022-04-27 11:48:48,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {905#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:48,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {905#true} {905#true} #79#return; {905#true} is VALID [2022-04-27 11:48:48,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:48,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(0 == ~cond); {905#true} is VALID [2022-04-27 11:48:48,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#true} ~cond := #in~cond; {905#true} is VALID [2022-04-27 11:48:48,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {905#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {905#true} is VALID [2022-04-27 11:48:48,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {905#true} is VALID [2022-04-27 11:48:48,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret3 := main(); {905#true} is VALID [2022-04-27 11:48:48,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #87#return; {905#true} is VALID [2022-04-27 11:48:48,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-27 11:48:48,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {905#true} is VALID [2022-04-27 11:48:48,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2022-04-27 11:48:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:48:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:48:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937550928] [2022-04-27 11:48:48,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:48:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482990479] [2022-04-27 11:48:48,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482990479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:48:48,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:48:48,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 11:48:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532267643] [2022-04-27 11:48:48,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:48:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-27 11:48:48,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:48:48,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 11:48:48,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:48,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:48:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:48:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:48:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:48:48,658 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 11:48:52,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:48:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:53,073 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 11:48:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:48:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-27 11:48:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:48:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 11:48:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 11:48:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 11:48:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 11:48:53,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 11:48:53,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:53,115 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:48:53,115 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:48:53,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:48:53,117 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:48:53,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 96 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 11:48:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:48:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-04-27 11:48:53,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:48:53,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:53,136 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:53,137 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:53,139 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 11:48:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 11:48:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:53,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-27 11:48:53,140 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-27 11:48:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:53,142 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 11:48:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 11:48:53,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:53,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:53,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:48:53,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:48:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 11:48:53,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 32 [2022-04-27 11:48:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:48:53,145 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 11:48:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 11:48:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 11:48:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:48:53,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:53,146 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 11:48:53,165 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 11:48:53,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:53,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 96987309, now seen corresponding path program 1 times [2022-04-27 11:48:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:53,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392088969] [2022-04-27 11:48:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:53,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:48:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919621122] [2022-04-27 11:48:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:53,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:53,376 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 11:48:53,406 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 11:48:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:53,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:48:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:48:53,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:48:53,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1296#true} call ULTIMATE.init(); {1296#true} is VALID [2022-04-27 11:48:53,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1296#true} assume true; {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1296#true} {1296#true} #87#return; {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1296#true} call #t~ret3 := main(); {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1296#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {1296#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1296#true} ~cond := #in~cond; {1296#true} is VALID [2022-04-27 11:48:53,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1296#true} assume !(0 == ~cond); {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1296#true} assume true; {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1296#true} {1296#true} #79#return; {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {1296#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1296#true} ~cond := #in~cond; {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1296#true} assume !(0 == ~cond); {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1296#true} assume true; {1296#true} is VALID [2022-04-27 11:48:53,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1296#true} {1296#true} #81#return; {1296#true} is VALID [2022-04-27 11:48:53,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {1296#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1349#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 11:48:53,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {1349#(= main_~B~0 main_~b~0)} assume !false; {1349#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 11:48:53,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1349#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1349#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 11:48:53,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1349#(= main_~B~0 main_~b~0)} assume !false; {1349#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 11:48:53,507 INFO L272 TraceCheckUtils]: 20: Hoare triple {1349#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1296#true} is VALID [2022-04-27 11:48:53,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1296#true} ~cond := #in~cond; {1296#true} is VALID [2022-04-27 11:48:53,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {1296#true} assume !(0 == ~cond); {1296#true} is VALID [2022-04-27 11:48:53,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {1296#true} assume true; {1296#true} is VALID [2022-04-27 11:48:53,509 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1296#true} {1349#(= main_~B~0 main_~b~0)} #83#return; {1349#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 11:48:53,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {1349#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1297#false} is VALID [2022-04-27 11:48:53,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1297#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1297#false} is VALID [2022-04-27 11:48:53,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {1297#false} assume !false; {1297#false} is VALID [2022-04-27 11:48:53,510 INFO L272 TraceCheckUtils]: 28: Hoare triple {1297#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1297#false} is VALID [2022-04-27 11:48:53,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {1297#false} ~cond := #in~cond; {1297#false} is VALID [2022-04-27 11:48:53,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {1297#false} assume 0 == ~cond; {1297#false} is VALID [2022-04-27 11:48:53,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {1297#false} assume !false; {1297#false} is VALID [2022-04-27 11:48:53,510 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 11:48:53,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:48:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:48:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392088969] [2022-04-27 11:48:53,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:48:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919621122] [2022-04-27 11:48:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919621122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:48:53,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:48:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:48:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40260194] [2022-04-27 11:48:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:48:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 32 [2022-04-27 11:48:53,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:48:53,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 11:48:53,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:48:53,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:48:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:48:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:48:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:48:53,542 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 11:48:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:55,674 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-27 11:48:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:48:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 32 [2022-04-27 11:48:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:48:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 11:48:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 11:48:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 11:48:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 11:48:55,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-27 11:48:55,712 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 11:48:55,713 INFO L225 Difference]: With dead ends: 46 [2022-04-27 11:48:55,713 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:48:55,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 11:48:55,714 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:48:55,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:48:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:48:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 11:48:55,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:48:55,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:55,722 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:55,722 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:55,724 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 11:48:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:48:55,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:55,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:55,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 11:48:55,725 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 11:48:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:48:55,727 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 11:48:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:48:55,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:48:55,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:48:55,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:48:55,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:48:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:48:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 11:48:55,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 32 [2022-04-27 11:48:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:48:55,729 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 11:48:55,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 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 11:48:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:48:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:48:55,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:48:55,730 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 11:48:55,752 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 11:48:55,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:55,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:48:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:48:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 852542504, now seen corresponding path program 1 times [2022-04-27 11:48:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:48:55,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147871136] [2022-04-27 11:48:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:48:55,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:48:55,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833564883] [2022-04-27 11:48:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:48:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:48:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:48:55,971 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 11:48:55,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process