/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:09:24,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:09:24,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:09:24,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:09:24,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:09:24,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:09:24,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:09:24,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:09:24,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:09:24,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:09:24,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:09:24,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:09:24,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:09:24,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:09:24,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:09:24,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:09:24,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:09:24,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:09:24,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:09:24,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:09:24,659 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:09:24,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:09:24,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:09:24,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:09:24,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:09:24,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:09:24,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:09:24,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:09:24,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:09:24,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:09:24,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:09:24,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:09:24,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:09:24,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:09:24,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:09:24,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:09:24,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:09:24,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:09:24,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:09:24,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:09:24,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:09:24,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:09:24,674 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 14:09:24,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:09:24,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:09:24,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:09:24,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:09:24,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:09:24,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:09:24,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:09:24,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:09:24,698 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:09:24,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:09:24,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:09:24,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:09:24,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:09:24,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:09:24,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:09:24,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:09:24,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:09:24,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:09:24,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:09:24,701 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 14:09:24,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:09:24,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:09:24,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:09:24,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:09:24,909 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:09:24,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound5.c [2022-04-27 14:09:24,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4249c52f/f15a8fda544446f2a4c216a6c85036e9/FLAG8c1357c4d [2022-04-27 14:09:25,300 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:09:25,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound5.c [2022-04-27 14:09:25,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4249c52f/f15a8fda544446f2a4c216a6c85036e9/FLAG8c1357c4d [2022-04-27 14:09:25,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4249c52f/f15a8fda544446f2a4c216a6c85036e9 [2022-04-27 14:09:25,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:09:25,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:09:25,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:09:25,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:09:25,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:09:25,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c4884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25, skipping insertion in model container [2022-04-27 14:09:25,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:09:25,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:09:25,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound5.c[537,550] [2022-04-27 14:09:25,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:09:25,486 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:09:25,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound5.c[537,550] [2022-04-27 14:09:25,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:09:25,511 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:09:25,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25 WrapperNode [2022-04-27 14:09:25,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:09:25,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:09:25,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:09:25,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:09:25,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:09:25,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:09:25,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:09:25,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:09:25,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (1/1) ... [2022-04-27 14:09:25,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:09:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:25,576 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 14:09:25,595 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 14:09:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:09:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:09:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:09:25,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:09:25,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:09:25,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:09:25,613 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:09:25,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:09:25,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:09:25,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:09:25,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:09:25,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:09:25,660 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:09:25,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:09:25,842 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:09:25,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:09:25,848 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:09:25,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:09:25 BoogieIcfgContainer [2022-04-27 14:09:25,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:09:25,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:09:25,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:09:25,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:09:25,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:09:25" (1/3) ... [2022-04-27 14:09:25,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47847ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:09:25, skipping insertion in model container [2022-04-27 14:09:25,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:25" (2/3) ... [2022-04-27 14:09:25,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47847ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:09:25, skipping insertion in model container [2022-04-27 14:09:25,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:09:25" (3/3) ... [2022-04-27 14:09:25,855 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound5.c [2022-04-27 14:09:25,864 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:09:25,864 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:09:25,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:09:25,900 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@430ea090, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ed64217 [2022-04-27 14:09:25,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:09:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:09:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:09:25,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:25,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:09:25,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 1 times [2022-04-27 14:09:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:25,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424548191] [2022-04-27 14:09:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:09:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-27 14:09:26,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:09:26,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 14:09:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:09:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:09:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:09:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:09:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 14:09:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:09:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 14:09:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 14:09:26,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:09:26,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-27 14:09:26,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:09:26,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 14:09:26,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-27 14:09:26,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-27 14:09:26,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:09:26,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:09:26,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:09:26,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:09:26,111 INFO L272 TraceCheckUtils]: 16: Hoare triple {36#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID [2022-04-27 14:09:26,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,112 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:09:26,112 INFO L272 TraceCheckUtils]: 21: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID [2022-04-27 14:09:26,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:26,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:26,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:26,113 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 14:09:26,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {36#false} is VALID [2022-04-27 14:09:26,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-27 14:09:26,118 INFO L272 TraceCheckUtils]: 28: Hoare triple {36#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {36#false} is VALID [2022-04-27 14:09:26,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:09:26,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:09:26,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:09:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:09:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:26,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424548191] [2022-04-27 14:09:26,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424548191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:26,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:26,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:09:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944060293] [2022-04-27 14:09:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:26,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 14:09:26,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:26,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,158 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 14:09:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:09:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:09:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:09:26,183 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,342 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions. [2022-04-27 14:09:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:09:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 14:09:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-27 14:09:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-27 14:09:26,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-04-27 14:09:26,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:26,442 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:09:26,442 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 14:09:26,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 14:09:26,450 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:09:26,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:09:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 14:09:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-27 14:09:26,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:26,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,475 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,475 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,478 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 14:09:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 14:09:26,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:26,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:26,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-04-27 14:09:26,479 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-04-27 14:09:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,482 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 14:09:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 14:09:26,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:26,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:26,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:26,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-27 14:09:26,485 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2022-04-27 14:09:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:26,485 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-27 14:09:26,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 14:09:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 14:09:26,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:26,487 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:09:26,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:09:26,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 1 times [2022-04-27 14:09:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977366147] [2022-04-27 14:09:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:26,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127718597] [2022-04-27 14:09:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:26,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:26,510 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 14:09:26,515 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 14:09:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:09:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:26,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:26,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2022-04-27 14:09:26,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#(<= ~counter~0 0)} {235#true} #73#return; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#(<= ~counter~0 0)} call #t~ret7 := main(); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} #61#return; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {243#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} #63#return; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,737 INFO L272 TraceCheckUtils]: 16: Hoare triple {243#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,738 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} #65#return; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,739 INFO L272 TraceCheckUtils]: 21: Hoare triple {243#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,741 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {243#(<= ~counter~0 0)} {243#(<= ~counter~0 0)} #67#return; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {243#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:26,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {322#(<= |main_#t~post6| 0)} is VALID [2022-04-27 14:09:26,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {322#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {236#false} is VALID [2022-04-27 14:09:26,742 INFO L272 TraceCheckUtils]: 29: Hoare triple {236#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {236#false} is VALID [2022-04-27 14:09:26,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2022-04-27 14:09:26,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2022-04-27 14:09:26,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-04-27 14:09:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:09:26,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:09:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977366147] [2022-04-27 14:09:26,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127718597] [2022-04-27 14:09:26,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127718597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:26,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:26,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:09:26,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699915759] [2022-04-27 14:09:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 14:09:26,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:26,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:26,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:09:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:09:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:09:26,764 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,825 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-27 14:09:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:09:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 14:09:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 14:09:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 14:09:26,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-27 14:09:26,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:26,878 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:09:26,878 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:09:26,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:09:26,880 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:09:26,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:09:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:09:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:09:26,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:26,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,894 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,894 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,897 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 14:09:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:26,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:26,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:26,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:09:26,901 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:09:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:26,904 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 14:09:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:26,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:26,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:26,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:26,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:09:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 14:09:26,920 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2022-04-27 14:09:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:26,921 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 14:09:26,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:09:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 14:09:26,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:26,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:09:26,941 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 14:09:27,122 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 14:09:27,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 1 times [2022-04-27 14:09:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:27,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384729704] [2022-04-27 14:09:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:27,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:27,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479947931] [2022-04-27 14:09:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:27,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:27,150 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 14:09:27,153 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 14:09:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:27,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:09:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:27,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:27,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2022-04-27 14:09:27,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {490#true} is VALID [2022-04-27 14:09:27,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:27,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #73#return; {490#true} is VALID [2022-04-27 14:09:27,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret7 := main(); {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {490#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {490#true} is VALID [2022-04-27 14:09:27,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {490#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:27,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {490#true} {490#true} #61#return; {490#true} is VALID [2022-04-27 14:09:27,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {490#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:27,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {490#true} {490#true} #63#return; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {490#true} {490#true} #65#return; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L272 TraceCheckUtils]: 21: Hoare triple {490#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:27,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:27,663 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {490#true} {490#true} #67#return; {490#true} is VALID [2022-04-27 14:09:27,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {490#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:09:27,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:09:27,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:09:27,668 INFO L272 TraceCheckUtils]: 29: Hoare triple {573#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {583#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 14:09:27,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {583#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:09:27,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2022-04-27 14:09:27,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {491#false} assume !false; {491#false} is VALID [2022-04-27 14:09:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:09:27,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:09:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384729704] [2022-04-27 14:09:27,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479947931] [2022-04-27 14:09:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479947931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:27,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:09:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841969775] [2022-04-27 14:09:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 14:09:27,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:27,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:09:27,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:27,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:09:27,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:09:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:09:27,693 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:09:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:27,832 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 14:09:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:09:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 14:09:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:09:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:09:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:09:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:09:27,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:09:27,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:27,873 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:09:27,873 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:09:27,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:09:27,874 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:09:27,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:09:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:09:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 14:09:27,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:27,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:09:27,883 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:09:27,883 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:09:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:27,884 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 14:09:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 14:09:27,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:27,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:27,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:09:27,885 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 14:09:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:27,887 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 14:09:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 14:09:27,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:27,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:27,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:27,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:09:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-27 14:09:27,888 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-04-27 14:09:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:27,889 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-27 14:09:27,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:09:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:09:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:09:27,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:27,889 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:09:27,908 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 14:09:28,103 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 14:09:28,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 1 times [2022-04-27 14:09:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:28,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435575215] [2022-04-27 14:09:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:28,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:28,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264226226] [2022-04-27 14:09:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:28,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:28,134 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 14:09:28,136 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 14:09:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:09:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:28,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:28,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 14:09:28,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {782#(<= ~counter~0 0)} {774#true} #73#return; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {782#(<= ~counter~0 0)} call #t~ret7 := main(); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {782#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {782#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} #61#return; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {782#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,383 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} #63#return; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,384 INFO L272 TraceCheckUtils]: 16: Hoare triple {782#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,385 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} #65#return; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,385 INFO L272 TraceCheckUtils]: 21: Hoare triple {782#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,386 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {782#(<= ~counter~0 0)} {782#(<= ~counter~0 0)} #67#return; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {782#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:28,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {782#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,388 INFO L272 TraceCheckUtils]: 29: Hoare triple {861#(<= ~counter~0 1)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {861#(<= ~counter~0 1)} ~cond := #in~cond; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {861#(<= ~counter~0 1)} assume !(0 == ~cond); {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {861#(<= ~counter~0 1)} assume true; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,390 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {861#(<= ~counter~0 1)} {861#(<= ~counter~0 1)} #69#return; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {861#(<= ~counter~0 1)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {861#(<= ~counter~0 1)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:28,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {861#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {889#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:09:28,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {889#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {775#false} is VALID [2022-04-27 14:09:28,391 INFO L272 TraceCheckUtils]: 38: Hoare triple {775#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-27 14:09:28,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 14:09:28,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 14:09:28,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 14:09:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:09:28,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:09:28,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 14:09:28,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 14:09:28,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 14:09:28,555 INFO L272 TraceCheckUtils]: 38: Hoare triple {775#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-27 14:09:28,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {917#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {775#false} is VALID [2022-04-27 14:09:28,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {921#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {917#(< |main_#t~post6| 5)} is VALID [2022-04-27 14:09:28,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {921#(< ~counter~0 5)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {921#(< ~counter~0 5)} is VALID [2022-04-27 14:09:28,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {921#(< ~counter~0 5)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {921#(< ~counter~0 5)} is VALID [2022-04-27 14:09:28,556 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {774#true} {921#(< ~counter~0 5)} #69#return; {921#(< ~counter~0 5)} is VALID [2022-04-27 14:09:28,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:28,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:28,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:28,557 INFO L272 TraceCheckUtils]: 29: Hoare triple {921#(< ~counter~0 5)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:28,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {921#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {921#(< ~counter~0 5)} is VALID [2022-04-27 14:09:28,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {949#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(< ~counter~0 5)} is VALID [2022-04-27 14:09:28,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {949#(< ~counter~0 4)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,558 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {774#true} {949#(< ~counter~0 4)} #67#return; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:28,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:28,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:28,559 INFO L272 TraceCheckUtils]: 21: Hoare triple {949#(< ~counter~0 4)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:28,559 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {774#true} {949#(< ~counter~0 4)} #65#return; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:28,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:28,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:28,559 INFO L272 TraceCheckUtils]: 16: Hoare triple {949#(< ~counter~0 4)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:28,560 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {774#true} {949#(< ~counter~0 4)} #63#return; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:28,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:28,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:28,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {949#(< ~counter~0 4)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:28,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {949#(< ~counter~0 4)} #61#return; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:28,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:28,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:28,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {949#(< ~counter~0 4)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:28,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(< ~counter~0 4)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#(< ~counter~0 4)} call #t~ret7 := main(); {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#(< ~counter~0 4)} {774#true} #73#return; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(< ~counter~0 4)} assume true; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {949#(< ~counter~0 4)} is VALID [2022-04-27 14:09:28,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 14:09:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:09:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435575215] [2022-04-27 14:09:28,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264226226] [2022-04-27 14:09:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264226226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:09:28,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:09:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:09:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591269122] [2022-04-27 14:09:28,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:09:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 14:09:28,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:28,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 14:09:28,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:28,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:09:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:28,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:09:28,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:09:28,611 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 14:09:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:28,793 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-27 14:09:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:09:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 14:09:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 14:09:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 14:09:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 14:09:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 14:09:28,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-27 14:09:28,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:09:28,855 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:09:28,855 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 14:09:28,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:09:28,856 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:09:28,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:09:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 14:09:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-04-27 14:09:28,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:28,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:09:28,869 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:09:28,870 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:09:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:28,871 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 14:09:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-27 14:09:28,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:28,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:28,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-27 14:09:28,872 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-27 14:09:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:28,874 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 14:09:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-27 14:09:28,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:28,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:28,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:28,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:09:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-27 14:09:28,876 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 42 [2022-04-27 14:09:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:28,876 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-27 14:09:28,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 14:09:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 14:09:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:09:28,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:28,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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 14:09:28,897 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 14:09:29,091 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 14:09:29,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 1 times [2022-04-27 14:09:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:29,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295313759] [2022-04-27 14:09:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:29,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:29,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316194866] [2022-04-27 14:09:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:29,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:29,142 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 14:09:29,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process