/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/lcm1_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:56:08,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:56:08,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:56:08,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:56:08,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:56:08,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:56:08,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:56:08,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:56:08,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:56:08,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:56:08,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:56:08,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:56:08,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:56:08,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:56:08,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:56:08,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:56:08,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:56:08,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:56:08,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:56:08,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:56:08,606 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:56:08,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:56:08,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:56:08,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:56:08,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:56:08,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:56:08,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:56:08,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:56:08,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:56:08,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:56:08,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:56:08,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:56:08,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:56:08,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:56:08,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:56:08,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:56:08,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:56:08,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:56:08,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:56:08,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:56:08,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:56:08,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:56:08,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:56:08,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:56:08,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:56:08,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:56:08,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:56:08,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:56:08,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:56:08,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:56:08,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:56:08,645 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:56:08,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:56:08,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:56:08,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:56:08,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:56:08,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:56:08,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:56:08,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:56:08,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:56:08,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:56:08,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:56:08,847 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:56:08,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound100.c [2022-04-27 13:56:08,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cf95cf4/8d0017cd31e84217a052638e4aee6da8/FLAGaadcc084c [2022-04-27 13:56:09,272 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:56:09,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound100.c [2022-04-27 13:56:09,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cf95cf4/8d0017cd31e84217a052638e4aee6da8/FLAGaadcc084c [2022-04-27 13:56:09,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cf95cf4/8d0017cd31e84217a052638e4aee6da8 [2022-04-27 13:56:09,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:56:09,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:56:09,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:56:09,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:56:09,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:56:09,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6442492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09, skipping insertion in model container [2022-04-27 13:56:09,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:56:09,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:56:09,504 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/lcm1_valuebound100.c[552,565] [2022-04-27 13:56:09,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:56:09,540 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:56:09,548 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/lcm1_valuebound100.c[552,565] [2022-04-27 13:56:09,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:56:09,561 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:56:09,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09 WrapperNode [2022-04-27 13:56:09,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:56:09,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:56:09,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:56:09,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:56:09,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:56:09,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:56:09,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:56:09,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:56:09,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (1/1) ... [2022-04-27 13:56:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:56:09,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:56:09,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:56:09,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:56:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:56:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:56:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:56:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:56:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:56:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:56:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:56:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:56:09,730 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:56:09,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:56:09,877 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:56:09,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:56:09,894 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:56:09,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:56:09 BoogieIcfgContainer [2022-04-27 13:56:09,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:56:09,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:56:09,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:56:09,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:56:09,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:56:09" (1/3) ... [2022-04-27 13:56:09,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa4dcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:56:09, skipping insertion in model container [2022-04-27 13:56:09,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:56:09" (2/3) ... [2022-04-27 13:56:09,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa4dcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:56:09, skipping insertion in model container [2022-04-27 13:56:09,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:56:09" (3/3) ... [2022-04-27 13:56:09,900 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_valuebound100.c [2022-04-27 13:56:09,913 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:56:09,913 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:56:09,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:56:09,960 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@779d992, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34f85b1e [2022-04-27 13:56:09,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:56:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:56:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:56:09,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:56:09,973 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:56:09,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:56:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:56:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1520729432, now seen corresponding path program 1 times [2022-04-27 13:56:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:56:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529679625] [2022-04-27 13:56:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:56:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:56:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:56:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(49, 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); {43#true} is VALID [2022-04-27 13:56:10,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:56:10,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #115#return; {43#true} is VALID [2022-04-27 13:56:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:56:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-27 13:56:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:56:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-27 13:56:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:56:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-27 13:56:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:56:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-27 13:56:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 13:56:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #101#return; {44#false} is VALID [2022-04-27 13:56:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 13:56:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #103#return; {44#false} is VALID [2022-04-27 13:56:10,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:56:10,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(49, 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); {43#true} is VALID [2022-04-27 13:56:10,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:56:10,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #115#return; {43#true} is VALID [2022-04-27 13:56:10,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-27 13:56:10,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#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; {43#true} is VALID [2022-04-27 13:56:10,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 0 && ~a~0 % 4294967296 <= 100 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-27 13:56:10,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} ~b~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-27 13:56:10,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 0 && ~b~0 % 4294967296 <= 100 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,251 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-27 13:56:10,251 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,253 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-27 13:56:10,253 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,254 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-27 13:56:10,254 INFO L272 TraceCheckUtils]: 27: Hoare triple {44#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,256 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44#false} {44#false} #101#return; {44#false} is VALID [2022-04-27 13:56:10,256 INFO L272 TraceCheckUtils]: 32: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-27 13:56:10,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:56:10,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:56:10,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:56:10,257 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {44#false} {44#false} #103#return; {44#false} is VALID [2022-04-27 13:56:10,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {44#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {44#false} is VALID [2022-04-27 13:56:10,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-27 13:56:10,258 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {44#false} is VALID [2022-04-27 13:56:10,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:56:10,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:56:10,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:56:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:56:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:56:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529679625] [2022-04-27 13:56:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529679625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:56:10,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:56:10,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:56:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827750285] [2022-04-27 13:56:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:56:10,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 13:56:10,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:56:10,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:56:10,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:56:10,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:56:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:56:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:56:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:56:10,354 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:56:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:10,507 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2022-04-27 13:56:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:56:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 13:56:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:56:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:56:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-04-27 13:56:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:56:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-04-27 13:56:10,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 121 transitions. [2022-04-27 13:56:10,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:56:10,693 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:56:10,694 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:56:10,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:56:10,698 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:56:10,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:56:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:56:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 13:56:10,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:56:10,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:56:10,719 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:56:10,720 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:56:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:10,724 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 13:56:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:56:10,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:56:10,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:56:10,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 35 states. [2022-04-27 13:56:10,730 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 35 states. [2022-04-27 13:56:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:10,738 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 13:56:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:56:10,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:56:10,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:56:10,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:56:10,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:56:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:56:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-27 13:56:10,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-27 13:56:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:56:10,743 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-27 13:56:10,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:56:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:56:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:56:10,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:56:10,745 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:56:10,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:56:10,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:56:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:56:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1122529479, now seen corresponding path program 1 times [2022-04-27 13:56:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:56:10,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716309228] [2022-04-27 13:56:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:56:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:56:10,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:56:10,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591622125] [2022-04-27 13:56:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:56:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:56:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:56:10,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:56:10,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:56:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:56:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:56:10,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:56:11,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2022-04-27 13:56:11,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#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(49, 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); {305#true} is VALID [2022-04-27 13:56:11,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #115#return; {305#true} is VALID [2022-04-27 13:56:11,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret6 := main(); {305#true} is VALID [2022-04-27 13:56:11,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#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; {305#true} is VALID [2022-04-27 13:56:11,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {305#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 0 && ~a~0 % 4294967296 <= 100 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {305#true} {305#true} #93#return; {305#true} is VALID [2022-04-27 13:56:11,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#true} ~b~0 := #t~nondet5;havoc #t~nondet5; {305#true} is VALID [2022-04-27 13:56:11,124 INFO L272 TraceCheckUtils]: 12: Hoare triple {305#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 0 && ~b~0 % 4294967296 <= 100 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {305#true} {305#true} #95#return; {305#true} is VALID [2022-04-27 13:56:11,125 INFO L272 TraceCheckUtils]: 17: Hoare triple {305#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,125 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {305#true} {305#true} #97#return; {305#true} is VALID [2022-04-27 13:56:11,126 INFO L272 TraceCheckUtils]: 22: Hoare triple {305#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,126 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {305#true} {305#true} #99#return; {305#true} is VALID [2022-04-27 13:56:11,126 INFO L272 TraceCheckUtils]: 27: Hoare triple {305#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,127 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {305#true} {305#true} #101#return; {305#true} is VALID [2022-04-27 13:56:11,127 INFO L272 TraceCheckUtils]: 32: Hoare triple {305#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {305#true} is VALID [2022-04-27 13:56:11,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-04-27 13:56:11,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-04-27 13:56:11,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {305#true} assume true; {305#true} is VALID [2022-04-27 13:56:11,128 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {305#true} {305#true} #103#return; {305#true} is VALID [2022-04-27 13:56:11,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {305#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {421#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:56:11,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {421#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !false; {421#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:56:11,130 INFO L272 TraceCheckUtils]: 39: Hoare triple {421#(and (= main_~v~0 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 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:56:11,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:56:11,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {306#false} is VALID [2022-04-27 13:56:11,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-27 13:56:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:56:11,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:56:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:56:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716309228] [2022-04-27 13:56:11,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:56:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591622125] [2022-04-27 13:56:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591622125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:56:11,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:56:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:56:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540932322] [2022-04-27 13:56:11,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:56:11,135 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 13:56:11,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:56:11,135 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:56:11,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:56:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:56:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:56:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:56:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:56:11,159 INFO L87 Difference]: Start difference. First operand 35 states and 46 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:56:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:11,413 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-27 13:56:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:56:11,413 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 13:56:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:56:11,414 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:56:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:56:11,417 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:56:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:56:11,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:56:11,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:56:11,487 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:56:11,488 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:56:11,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:56:11,489 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:56:11,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:56:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:56:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-04-27 13:56:11,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:56:11,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:56:11,496 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:56:11,496 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:56:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:11,499 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-27 13:56:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:56:11,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:56:11,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:56:11,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 50 states. [2022-04-27 13:56:11,500 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 50 states. [2022-04-27 13:56:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:56:11,503 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-27 13:56:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:56:11,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:56:11,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:56:11,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:56:11,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:56:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:56:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-27 13:56:11,506 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 43 [2022-04-27 13:56:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:56:11,507 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-27 13:56:11,507 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:56:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-27 13:56:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:56:11,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:56:11,508 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:56:11,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:56:11,723 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 13:56:11,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:56:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:56:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 314996066, now seen corresponding path program 1 times [2022-04-27 13:56:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:56:11,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070214508] [2022-04-27 13:56:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:56:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:56:11,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:56:11,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200403256] [2022-04-27 13:56:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:56:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:56:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:56:11,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:56:11,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process