/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:09:35,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:09:35,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:09:35,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:09:35,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:09:35,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:09:35,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:09:35,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:09:35,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:09:35,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:09:35,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:09:35,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:09:35,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:09:35,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:09:35,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:09:35,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:09:35,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:09:35,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:09:35,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:09:35,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:09:35,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:09:35,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:09:35,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:09:35,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:09:35,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:09:35,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:09:35,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:09:35,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:09:35,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:09:35,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:09:35,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:09:35,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:09:35,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:09:35,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:09:35,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:09:35,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:09:35,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:09:35,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:09:35,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:09:35,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:09:35,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:09:35,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:09:35,476 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:35,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:09:35,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:09:35,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:09:35,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:09:35,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:09:35,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:09:35,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:09:35,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:09:35,493 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:09:35,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:09:35,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:09:35,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:09:35,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:09:35,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:09:35,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:09:35,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:09:35,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:09:35,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:09:35,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:09:35,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:09:35,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:09:35,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:09:35,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:09:35,498 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:35,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:09:35,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:09:35,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:09:35,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:09:35,639 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:09:35,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound50.c [2022-04-27 14:09:35,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dca84ed1/2ff4db12afe1491da5aae6191658871b/FLAGf5cfc360a [2022-04-27 14:09:36,044 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:09:36,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound50.c [2022-04-27 14:09:36,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dca84ed1/2ff4db12afe1491da5aae6191658871b/FLAGf5cfc360a [2022-04-27 14:09:36,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dca84ed1/2ff4db12afe1491da5aae6191658871b [2022-04-27 14:09:36,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:09:36,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:09:36,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:09:36,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:09:36,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:09:36,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:09:36" (1/1) ... [2022-04-27 14:09:36,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b097cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:36, skipping insertion in model container [2022-04-27 14:09:36,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:09:36" (1/1) ... [2022-04-27 14:09:36,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:09:36,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:09:36,186 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_unwindbound50.c[537,550] [2022-04-27 14:09:36,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:09:36,210 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:09:36,217 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_unwindbound50.c[537,550] [2022-04-27 14:09:36,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:09:36,229 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:09:36,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:36 WrapperNode [2022-04-27 14:09:36,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:09:36,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:09:36,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:09:36,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:09:36,237 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:36" (1/1) ... [2022-04-27 14:09:36,237 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:36" (1/1) ... [2022-04-27 14:09:36,240 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:36" (1/1) ... [2022-04-27 14:09:36,241 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:36" (1/1) ... [2022-04-27 14:09:36,244 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:36" (1/1) ... [2022-04-27 14:09:36,247 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:36" (1/1) ... [2022-04-27 14:09:36,248 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:36" (1/1) ... [2022-04-27 14:09:36,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:09:36,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:09:36,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:09:36,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:09:36,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:36" (1/1) ... [2022-04-27 14:09:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:09:36,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:36,271 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:36,291 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:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:09:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:09:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:09:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:09:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:09:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 14:09:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:09:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:09:36,336 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:09:36,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:09:36,440 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:09:36,445 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:09:36,445 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:09:36,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:09:36 BoogieIcfgContainer [2022-04-27 14:09:36,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:09:36,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:09:36,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:09:36,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:09:36,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:09:36" (1/3) ... [2022-04-27 14:09:36,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ed9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:09:36, skipping insertion in model container [2022-04-27 14:09:36,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:09:36" (2/3) ... [2022-04-27 14:09:36,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ed9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:09:36, skipping insertion in model container [2022-04-27 14:09:36,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:09:36" (3/3) ... [2022-04-27 14:09:36,451 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound50.c [2022-04-27 14:09:36,460 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:09:36,460 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:09:36,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:09:36,503 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@141502a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c4b5108 [2022-04-27 14:09:36,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:09:36,518 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:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:09:36,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:36,524 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:36,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 1 times [2022-04-27 14:09:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:36,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98432735] [2022-04-27 14:09:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:09:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,671 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:36,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:09:36,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 14:09:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:09:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:09:36,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:09:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:09:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 14:09:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:09:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 14:09:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:36,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 14:09:36,700 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:36,700 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:36,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:09:36,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 14:09:36,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-27 14:09:36,701 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:36,701 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:36,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:09:36,702 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:36,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,703 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:09:36,703 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:36,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,704 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:09:36,704 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:36,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:09:36,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:09:36,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:09:36,705 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 14:09:36,705 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:36,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-27 14:09:36,705 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:36,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:09:36,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:09:36,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:09:36,706 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:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:36,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98432735] [2022-04-27 14:09:36,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98432735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:36,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:36,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:09:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069705560] [2022-04-27 14:09:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:36,713 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:36,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:36,718 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:36,741 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:36,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:09:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:09:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:09:36,756 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:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:36,868 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions. [2022-04-27 14:09:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:09:36,868 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:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:36,869 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:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-27 14:09:36,876 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:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-27 14:09:36,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-04-27 14:09:36,948 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:36,954 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:09:36,954 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 14:09:36,956 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:36,958 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:36,959 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:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 14:09:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-27 14:09:36,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:36,978 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:36,978 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:36,979 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:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:36,981 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 14:09:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 14:09:36,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:36,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:36,982 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:36,982 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:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:36,984 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 14:09:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 14:09:36,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:36,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:36,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:36,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:36,985 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:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-27 14:09:36,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2022-04-27 14:09:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:36,988 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-27 14:09:36,988 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:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 14:09:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 14:09:36,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:36,989 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:36,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:09:36,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 1 times [2022-04-27 14:09:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:36,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660641362] [2022-04-27 14:09:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:37,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571884130] [2022-04-27 14:09:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:37,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:37,017 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:37,036 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:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:37,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:09:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:37,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:37,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2022-04-27 14:09:37,306 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:37,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,307 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:37,308 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:37,308 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:37,309 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:37,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,310 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:37,311 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:37,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,313 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:37,313 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:37,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,315 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:37,315 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:37,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {243#(<= ~counter~0 0)} ~cond := #in~cond; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#(<= ~counter~0 0)} assume !(0 == ~cond); {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#(<= ~counter~0 0)} assume true; {243#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:37,317 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:37,317 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:37,318 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:37,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {322#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {236#false} is VALID [2022-04-27 14:09:37,319 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:37,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2022-04-27 14:09:37,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2022-04-27 14:09:37,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-04-27 14:09:37,319 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:37,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:09:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:37,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660641362] [2022-04-27 14:09:37,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:37,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571884130] [2022-04-27 14:09:37,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571884130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:37,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:37,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:09:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469718521] [2022-04-27 14:09:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:37,322 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:37,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:37,322 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:37,340 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:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:09:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:09:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:09:37,342 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:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:37,411 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-27 14:09:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:09:37,411 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:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:37,412 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:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 14:09:37,419 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:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 14:09:37,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-27 14:09:37,453 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:37,458 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:09:37,459 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:09:37,460 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:37,462 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:37,463 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:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:09:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:09:37,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:37,475 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:37,476 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:37,477 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:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:37,480 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 14:09:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:37,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:37,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:37,482 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:37,483 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:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:37,488 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 14:09:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:37,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:37,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:37,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:37,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:37,492 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:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 14:09:37,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2022-04-27 14:09:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:37,499 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 14:09:37,499 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:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 14:09:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 14:09:37,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:37,501 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:37,517 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:37,715 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:37,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 1 times [2022-04-27 14:09:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198871333] [2022-04-27 14:09:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:37,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726303150] [2022-04-27 14:09:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:37,746 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:37,747 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:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:37,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 14:09:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:37,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:38,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2022-04-27 14:09:38,213 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:38,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:38,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #73#return; {490#true} is VALID [2022-04-27 14:09:38,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret7 := main(); {490#true} is VALID [2022-04-27 14:09:38,213 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:38,214 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:38,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:38,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:38,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:38,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {490#true} {490#true} #61#return; {490#true} is VALID [2022-04-27 14:09:38,214 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:38,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:38,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:38,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:38,214 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {490#true} {490#true} #63#return; {490#true} is VALID [2022-04-27 14:09:38,215 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:38,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:38,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:38,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:38,215 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {490#true} {490#true} #65#return; {490#true} is VALID [2022-04-27 14:09:38,215 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:38,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-27 14:09:38,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-27 14:09:38,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-27 14:09:38,216 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {490#true} {490#true} #67#return; {490#true} is VALID [2022-04-27 14:09:38,218 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:38,219 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:38,219 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 < 50);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:38,220 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:38,220 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:38,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2022-04-27 14:09:38,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {491#false} assume !false; {491#false} is VALID [2022-04-27 14:09:38,221 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:38,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:09:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:38,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198871333] [2022-04-27 14:09:38,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:38,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726303150] [2022-04-27 14:09:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726303150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:09:38,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:09:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:09:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715485083] [2022-04-27 14:09:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:09:38,222 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:38,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:38,223 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:38,243 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:38,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:09:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:09:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:09:38,244 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:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:38,397 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 14:09:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:09:38,397 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:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:38,397 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:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:09:38,399 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:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:09:38,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:09:38,436 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:38,437 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:09:38,437 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:09:38,438 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:38,439 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:09:38,439 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.1s Time] [2022-04-27 14:09:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:09:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 14:09:38,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:38,446 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:38,447 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:38,447 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:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:38,448 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 14:09:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 14:09:38,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:38,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:38,449 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:38,449 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:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:38,451 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 14:09:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 14:09:38,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:38,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:38,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:38,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:38,451 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:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-27 14:09:38,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-04-27 14:09:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:38,453 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-27 14:09:38,453 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:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:09:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:09:38,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:38,453 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:38,469 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:38,669 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:38,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 1 times [2022-04-27 14:09:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878575476] [2022-04-27 14:09:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:38,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634806889] [2022-04-27 14:09:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:38,688 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:38,691 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:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:38,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:09:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:09:38,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:09:38,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 14:09:38,896 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:38,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,906 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:38,906 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:38,906 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:38,907 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:38,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,909 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:38,909 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:38,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,924 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:38,927 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:38,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,928 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:38,928 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:38,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {782#(<= ~counter~0 0)} ~cond := #in~cond; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {782#(<= ~counter~0 0)} assume !(0 == ~cond); {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= ~counter~0 0)} assume true; {782#(<= ~counter~0 0)} is VALID [2022-04-27 14:09:38,931 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:38,932 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:38,932 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:38,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:38,933 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:38,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {861#(<= ~counter~0 1)} ~cond := #in~cond; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:38,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {861#(<= ~counter~0 1)} assume !(0 == ~cond); {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:38,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {861#(<= ~counter~0 1)} assume true; {861#(<= ~counter~0 1)} is VALID [2022-04-27 14:09:38,935 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:38,935 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:38,935 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:38,935 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:38,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {889#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {775#false} is VALID [2022-04-27 14:09:38,939 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:38,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 14:09:38,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 14:09:38,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 14:09:38,939 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:38,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:09:39,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 14:09:39,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 14:09:39,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 14:09:39,106 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:39,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {917#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {775#false} is VALID [2022-04-27 14:09:39,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {921#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {917#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:09:39,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {921#(< ~counter~0 50)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {921#(< ~counter~0 50)} is VALID [2022-04-27 14:09:39,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {921#(< ~counter~0 50)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {921#(< ~counter~0 50)} is VALID [2022-04-27 14:09:39,108 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {774#true} {921#(< ~counter~0 50)} #69#return; {921#(< ~counter~0 50)} is VALID [2022-04-27 14:09:39,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:39,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:39,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:39,109 INFO L272 TraceCheckUtils]: 29: Hoare triple {921#(< ~counter~0 50)} 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:39,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {921#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {921#(< ~counter~0 50)} is VALID [2022-04-27 14:09:39,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {949#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(< ~counter~0 50)} is VALID [2022-04-27 14:09:39,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {949#(< ~counter~0 49)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,110 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {774#true} {949#(< ~counter~0 49)} #67#return; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:39,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:39,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:39,110 INFO L272 TraceCheckUtils]: 21: Hoare triple {949#(< ~counter~0 49)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:39,111 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {774#true} {949#(< ~counter~0 49)} #65#return; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:39,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:39,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:39,111 INFO L272 TraceCheckUtils]: 16: Hoare triple {949#(< ~counter~0 49)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:39,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {774#true} {949#(< ~counter~0 49)} #63#return; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:39,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:39,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:39,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {949#(< ~counter~0 49)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:39,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {949#(< ~counter~0 49)} #61#return; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 14:09:39,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-27 14:09:39,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-27 14:09:39,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {949#(< ~counter~0 49)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-27 14:09:39,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(< ~counter~0 49)} 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 49)} is VALID [2022-04-27 14:09:39,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#(< ~counter~0 49)} call #t~ret7 := main(); {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#(< ~counter~0 49)} {774#true} #73#return; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(< ~counter~0 49)} assume true; {949#(< ~counter~0 49)} is VALID [2022-04-27 14:09:39,116 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 49)} is VALID [2022-04-27 14:09:39,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 14:09:39,116 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:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:09:39,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878575476] [2022-04-27 14:09:39,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:09:39,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634806889] [2022-04-27 14:09:39,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634806889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:09:39,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:09:39,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:09:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062271519] [2022-04-27 14:09:39,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:09:39,119 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:39,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:09:39,120 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:39,166 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:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:09:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:09:39,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:09:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:09:39,167 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:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:39,354 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-27 14:09:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:09:39,354 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:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:09:39,354 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:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 14:09:39,356 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:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 14:09:39,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-27 14:09:39,411 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:39,413 INFO L225 Difference]: With dead ends: 69 [2022-04-27 14:09:39,413 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 14:09:39,413 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:39,414 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:39,414 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:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 14:09:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-04-27 14:09:39,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:09:39,430 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:39,431 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:39,431 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:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:39,433 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 14:09:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-27 14:09:39,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:39,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:39,433 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:39,434 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:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:09:39,436 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 14:09:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-27 14:09:39,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:09:39,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:09:39,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:09:39,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:09:39,436 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:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-27 14:09:39,438 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 42 [2022-04-27 14:09:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:09:39,438 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-27 14:09:39,438 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:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 14:09:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 14:09:39,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:09:39,439 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:39,457 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:39,655 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:39,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:09:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:09:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 1 times [2022-04-27 14:09:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:09:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460120515] [2022-04-27 14:09:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:09:39,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:09:39,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190006792] [2022-04-27 14:09:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:09:39,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:09:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:09:39,671 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:39,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process