/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:11:05,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:11:05,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:11:05,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:11:05,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:11:05,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:11:05,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:11:05,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:11:05,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:11:05,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:11:05,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:11:05,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:11:05,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:11:05,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:11:05,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:11:05,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:11:05,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:11:05,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:11:05,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:11:05,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:11:05,305 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:11:05,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:11:05,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:11:05,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:11:05,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:11:05,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:11:05,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:11:05,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:11:05,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:11:05,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:11:05,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:11:05,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:11:05,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:11:05,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:11:05,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:11:05,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:11:05,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:11:05,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:11:05,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:11:05,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:11:05,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:11:05,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:11:05,316 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:11:05,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:11:05,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:11:05,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:11:05,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:11:05,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:11:05,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:11:05,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:11:05,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:11:05,335 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:11:05,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:11:05,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:11:05,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:11:05,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:11:05,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:11:05,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:11:05,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:11:05,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:11:05,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:11:05,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:11:05,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:11:05,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:11:05,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:11:05,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:11:05,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:11:05,340 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:11:05,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:11:05,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:11:05,341 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:11:05,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:11:05,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:11:05,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:11:05,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:11:05,532 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:11:05,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound2.c [2022-04-27 14:11:05,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cf00d1/d0ad60b11f51495aa521afa2809032f0/FLAG24631fe58 [2022-04-27 14:11:05,981 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:11:05,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound2.c [2022-04-27 14:11:05,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cf00d1/d0ad60b11f51495aa521afa2809032f0/FLAG24631fe58 [2022-04-27 14:11:06,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cf00d1/d0ad60b11f51495aa521afa2809032f0 [2022-04-27 14:11:06,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:11:06,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:11:06,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:11:06,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:11:06,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:11:06,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a4fd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06, skipping insertion in model container [2022-04-27 14:11:06,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:11:06,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:11:06,189 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_valuebound2.c[537,550] [2022-04-27 14:11:06,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:11:06,223 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:11:06,235 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_valuebound2.c[537,550] [2022-04-27 14:11:06,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:11:06,260 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:11:06,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06 WrapperNode [2022-04-27 14:11:06,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:11:06,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:11:06,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:11:06,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:11:06,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:11:06,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:11:06,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:11:06,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:11:06,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (1/1) ... [2022-04-27 14:11:06,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:11:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:11:06,357 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:11:06,430 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:11:06,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:11:06,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:11:06,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:11:06,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:11:06,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:11:06,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:11:06,501 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:11:06,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:11:06,624 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:11:06,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:11:06,629 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:11:06,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:11:06 BoogieIcfgContainer [2022-04-27 14:11:06,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:11:06,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:11:06,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:11:06,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:11:06,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:11:06" (1/3) ... [2022-04-27 14:11:06,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a24893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:11:06, skipping insertion in model container [2022-04-27 14:11:06,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:11:06" (2/3) ... [2022-04-27 14:11:06,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a24893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:11:06, skipping insertion in model container [2022-04-27 14:11:06,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:11:06" (3/3) ... [2022-04-27 14:11:06,635 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound2.c [2022-04-27 14:11:06,646 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:11:06,647 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:11:06,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:11:06,703 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@1050da59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@690d3bf2 [2022-04-27 14:11:06,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:11:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:11:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:11:06,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:11:06,736 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:11:06,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:11:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:11:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1830914611, now seen corresponding path program 1 times [2022-04-27 14:11:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:11:06,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954838258] [2022-04-27 14:11:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:11:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:11:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:11:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(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); {37#true} is VALID [2022-04-27 14:11:06,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:11:06,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #79#return; {37#true} is VALID [2022-04-27 14:11:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:11:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:06,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:06,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:06,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-27 14:11:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:11:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:06,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:06,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:06,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-27 14:11:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:11:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:06,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:06,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:06,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #67#return; {38#false} is VALID [2022-04-27 14:11:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 14:11:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:06,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:06,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:06,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #69#return; {38#false} is VALID [2022-04-27 14:11:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 14:11:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:06,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:06,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:06,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:06,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #71#return; {38#false} is VALID [2022-04-27 14:11:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 14:11:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:07,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:11:07,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:11:07,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(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); {37#true} is VALID [2022-04-27 14:11:07,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:11:07,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #79#return; {37#true} is VALID [2022-04-27 14:11:07,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-27 14:11:07,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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; {37#true} is VALID [2022-04-27 14:11:07,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 0 && ~a~0 % 4294967296 <= 2 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-27 14:11:07,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~b~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-27 14:11:07,014 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 0 && ~b~0 % 4294967296 <= 2 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-27 14:11:07,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,018 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #67#return; {38#false} is VALID [2022-04-27 14:11:07,018 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,022 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #69#return; {38#false} is VALID [2022-04-27 14:11:07,022 INFO L272 TraceCheckUtils]: 27: Hoare triple {38#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,024 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38#false} {38#false} #71#return; {38#false} is VALID [2022-04-27 14:11:07,024 INFO L272 TraceCheckUtils]: 32: Hoare triple {38#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {37#true} is VALID [2022-04-27 14:11:07,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:11:07,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:11:07,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {38#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L272 TraceCheckUtils]: 39: Hoare triple {38#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-27 14:11:07,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 14:11:07,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 14:11:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:11:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:11:07,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954838258] [2022-04-27 14:11:07,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954838258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:11:07,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:11:07,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:11:07,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472981278] [2022-04-27 14:11:07,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:11:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 14:11:07,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:11:07,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:11:07,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:11:07,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:11:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:11:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:11:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:11:07,093 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:11:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:07,246 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-27 14:11:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:11:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 14:11:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:11:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:11:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 14:11:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:11:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 14:11:07,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-27 14:11:07,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:11:07,382 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:11:07,382 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:11:07,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:11:07,389 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:11:07,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:11:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:11:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:11:07,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:11:07,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:11:07,417 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:11:07,418 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:11:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:07,426 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:11:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:11:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:11:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:11:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-27 14:11:07,428 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-27 14:11:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:07,433 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:11:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:11:07,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:11:07,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:11:07,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:11:07,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:11:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:11:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-27 14:11:07,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 43 [2022-04-27 14:11:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:11:07,444 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-27 14:11:07,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:11:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:11:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:11:07,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:11:07,446 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:11:07,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:11:07,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:11:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:11:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 206107499, now seen corresponding path program 1 times [2022-04-27 14:11:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:11:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691147978] [2022-04-27 14:11:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:11:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:11:07,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:11:07,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260336847] [2022-04-27 14:11:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:11:07,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:11:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:11:07,478 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:11:07,479 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:11:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:07,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 14:11:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:11:07,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:11:07,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2022-04-27 14:11:07,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#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); {257#true} is VALID [2022-04-27 14:11:07,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #79#return; {257#true} is VALID [2022-04-27 14:11:07,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret6 := main(); {257#true} is VALID [2022-04-27 14:11:07,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#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; {257#true} is VALID [2022-04-27 14:11:07,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {257#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 0 && ~a~0 % 4294967296 <= 2 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {257#true} {257#true} #63#return; {257#true} is VALID [2022-04-27 14:11:07,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#true} ~b~0 := #t~nondet5;havoc #t~nondet5; {257#true} is VALID [2022-04-27 14:11:07,944 INFO L272 TraceCheckUtils]: 12: Hoare triple {257#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 0 && ~b~0 % 4294967296 <= 2 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,945 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {257#true} {257#true} #65#return; {257#true} is VALID [2022-04-27 14:11:07,945 INFO L272 TraceCheckUtils]: 17: Hoare triple {257#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {257#true} {257#true} #67#return; {257#true} is VALID [2022-04-27 14:11:07,946 INFO L272 TraceCheckUtils]: 22: Hoare triple {257#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {257#true} {257#true} #69#return; {257#true} is VALID [2022-04-27 14:11:07,946 INFO L272 TraceCheckUtils]: 27: Hoare triple {257#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,947 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {257#true} {257#true} #71#return; {257#true} is VALID [2022-04-27 14:11:07,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {257#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {257#true} is VALID [2022-04-27 14:11:07,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2022-04-27 14:11:07,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2022-04-27 14:11:07,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-27 14:11:07,948 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {257#true} {257#true} #73#return; {257#true} is VALID [2022-04-27 14:11:07,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {257#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {373#(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:11:07,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {373#(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 !false; {373#(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:11:07,950 INFO L272 TraceCheckUtils]: 39: Hoare triple {373#(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)); {380#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 14:11:07,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {380#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {384#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:11:07,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {384#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {258#false} is VALID [2022-04-27 14:11:07,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-27 14:11:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:11:07,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:11:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:11:07,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691147978] [2022-04-27 14:11:07,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:11:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260336847] [2022-04-27 14:11:07,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260336847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:11:07,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:11:07,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:11:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399397138] [2022-04-27 14:11:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:11:07,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:11:07,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:11:07,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:11:07,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:11:07,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:11:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:11:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:11:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:11:07,978 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:11:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:08,129 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 14:11:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:11:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:11:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:11:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:11:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 14:11:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:11:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 14:11:08,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 14:11:08,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:11:08,176 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:11:08,176 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:11:08,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:11:08,177 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:11:08,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 105 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:11:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:11:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-27 14:11:08,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:11:08,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:11:08,182 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:11:08,183 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:11:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:08,184 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 14:11:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-27 14:11:08,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:11:08,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:11:08,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-27 14:11:08,186 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-27 14:11:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:11:08,187 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 14:11:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-27 14:11:08,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:11:08,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:11:08,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:11:08,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:11:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:11:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 14:11:08,190 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 43 [2022-04-27 14:11:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:11:08,190 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 14:11:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:11:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 14:11:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:11:08,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:11:08,191 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-27 14:11:08,212 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:11:08,412 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:11:08,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:11:08,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:11:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1555618915, now seen corresponding path program 1 times [2022-04-27 14:11:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:11:08,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131880942] [2022-04-27 14:11:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:11:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:11:08,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:11:08,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966432353] [2022-04-27 14:11:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:11:08,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:11:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:11:08,436 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:11:08,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process