/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:53:15,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:53:15,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:53:15,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:53:15,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:53:15,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:53:15,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:53:15,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:53:15,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:53:15,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:53:15,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:53:15,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:53:15,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:53:15,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:53:15,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:53:15,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:53:15,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:53:15,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:53:15,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:53:15,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:53:15,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:53:15,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:53:15,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:53:15,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:53:15,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:53:15,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:53:15,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:53:15,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:53:15,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:53:15,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:53:15,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:53:15,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:53:15,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:53:15,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:53:15,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:53:15,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:53:15,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:53:15,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:53:15,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:53:15,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:53:15,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:53:15,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:53:15,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:53:15,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:53:15,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:53:15,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:53:15,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:53:15,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:53:15,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:53:15,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:53:15,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:53:15,119 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:53:15,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:53:15,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:53:15,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:53:15,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:53:15,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:53:15,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:53:15,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:53:15,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:53:15,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:53:15,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:53:15,311 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:53:15,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound100.c [2022-04-27 13:53:15,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c9db06/2dcfda1615c649c6937fb363f1e7ca21/FLAGfb6e280a6 [2022-04-27 13:53:15,690 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:53:15,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound100.c [2022-04-27 13:53:15,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c9db06/2dcfda1615c649c6937fb363f1e7ca21/FLAGfb6e280a6 [2022-04-27 13:53:16,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0c9db06/2dcfda1615c649c6937fb363f1e7ca21 [2022-04-27 13:53:16,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:53:16,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:53:16,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:53:16,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:53:16,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:53:16,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505ff2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16, skipping insertion in model container [2022-04-27 13:53:16,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:53:16,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:53:16,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound100.c[552,565] [2022-04-27 13:53:16,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:53:16,276 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:53:16,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound100.c[552,565] [2022-04-27 13:53:16,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:53:16,300 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:53:16,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16 WrapperNode [2022-04-27 13:53:16,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:53:16,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:53:16,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:53:16,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:53:16,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:53:16,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:53:16,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:53:16,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:53:16,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (1/1) ... [2022-04-27 13:53:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:53:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:53:16,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:53:16,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:53:16,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:53:16,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:53:16,395 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:53:16,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:53:16,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:53:16,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:53:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:53:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:53:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:53:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:53:16,446 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:53:16,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:53:16,614 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:53:16,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:53:16,620 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:53:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:53:16 BoogieIcfgContainer [2022-04-27 13:53:16,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:53:16,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:53:16,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:53:16,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:53:16,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:53:16" (1/3) ... [2022-04-27 13:53:16,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66902ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:53:16, skipping insertion in model container [2022-04-27 13:53:16,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:53:16" (2/3) ... [2022-04-27 13:53:16,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66902ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:53:16, skipping insertion in model container [2022-04-27 13:53:16,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:53:16" (3/3) ... [2022-04-27 13:53:16,629 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound100.c [2022-04-27 13:53:16,638 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:53:16,639 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:53:16,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:53:16,689 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@7ece4433, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c2e0d90 [2022-04-27 13:53:16,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:53:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:53:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 13:53:16,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:53:16,711 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 13:53:16,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:53:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:53:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1515787587, now seen corresponding path program 1 times [2022-04-27 13:53:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:53:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039125436] [2022-04-27 13:53:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:53:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:53:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(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(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-27 13:53:16,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:53:16,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #111#return; {43#true} is VALID [2022-04-27 13:53:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:53:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-27 13:53:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 13:53:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-27 13:53:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 13:53:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-27 13:53:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 13:53:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:16,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-27 13:53:16,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:53:16,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(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(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-27 13:53:16,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:53:16,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #111#return; {43#true} is VALID [2022-04-27 13:53:16,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-27 13:53:16,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-27 13:53:16,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:53:16,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-27 13:53:16,868 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:53:16,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,869 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-27 13:53:16,869 INFO L272 TraceCheckUtils]: 16: Hoare triple {44#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-27 13:53:16,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,870 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-27 13:53:16,870 INFO L272 TraceCheckUtils]: 21: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-27 13:53:16,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:53:16,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:53:16,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:53:16,871 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-27 13:53:16,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {44#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {44#false} is VALID [2022-04-27 13:53:16,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-27 13:53:16,871 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {44#false} is VALID [2022-04-27 13:53:16,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:53:16,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:53:16,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:53:16,872 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 13:53:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:53:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039125436] [2022-04-27 13:53:16,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039125436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:53:16,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:53:16,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:53:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715431150] [2022-04-27 13:53:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:53:16,878 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 13:53:16,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:53:16,881 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 13:53:16,903 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 13:53:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:53:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:53:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:53:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:53:16,919 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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 13:53:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,059 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2022-04-27 13:53:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:53:17,060 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 13:53:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:53:17,061 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 13:53:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-27 13:53:17,068 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 13:53:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-27 13:53:17,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-04-27 13:53:17,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:53:17,188 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:53:17,188 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 13:53:17,191 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 13:53:17,195 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:53:17,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:53:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 13:53:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 13:53:17,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:53:17,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,229 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,229 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,237 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 13:53:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 13:53:17,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:17,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:17,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-27 13:53:17,241 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-27 13:53:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,250 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 13:53:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 13:53:17,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:17,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:17,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:53:17,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:53:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-27 13:53:17,257 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 32 [2022-04-27 13:53:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:53:17,257 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-04-27 13:53:17,258 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 13:53:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 13:53:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:53:17,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:53:17,260 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 13:53:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:53:17,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:53:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:53:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 182383832, now seen corresponding path program 1 times [2022-04-27 13:53:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:53:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856222454] [2022-04-27 13:53:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:53:17,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:53:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304760080] [2022-04-27 13:53:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:53:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:53:17,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:53:17,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:53:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:17,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:53:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:53:17,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-27 13:53:17,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#(<= ~counter~0 0)} assume true; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {303#(<= ~counter~0 0)} {295#true} #111#return; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {303#(<= ~counter~0 0)} call #t~ret9 := main(); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {303#(<= ~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; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {303#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(<= ~counter~0 0)} ~cond := #in~cond; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {303#(<= ~counter~0 0)} assume !(0 == ~cond); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#(<= ~counter~0 0)} assume true; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} #93#return; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,608 INFO L272 TraceCheckUtils]: 11: Hoare triple {303#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(<= ~counter~0 0)} ~cond := #in~cond; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#(<= ~counter~0 0)} assume !(0 == ~cond); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#(<= ~counter~0 0)} assume true; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} #95#return; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,610 INFO L272 TraceCheckUtils]: 16: Hoare triple {303#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= ~counter~0 0)} ~cond := #in~cond; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {303#(<= ~counter~0 0)} assume !(0 == ~cond); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {303#(<= ~counter~0 0)} assume true; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,611 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} #97#return; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,612 INFO L272 TraceCheckUtils]: 21: Hoare triple {303#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {303#(<= ~counter~0 0)} ~cond := #in~cond; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {303#(<= ~counter~0 0)} assume !(0 == ~cond); {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {303#(<= ~counter~0 0)} assume true; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,613 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} #99#return; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {303#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {303#(<= ~counter~0 0)} is VALID [2022-04-27 13:53:17,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {303#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {382#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:53:17,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {382#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {296#false} is VALID [2022-04-27 13:53:17,615 INFO L272 TraceCheckUtils]: 29: Hoare triple {296#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {296#false} is VALID [2022-04-27 13:53:17,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {296#false} ~cond := #in~cond; {296#false} is VALID [2022-04-27 13:53:17,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {296#false} assume 0 == ~cond; {296#false} is VALID [2022-04-27 13:53:17,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-27 13:53:17,615 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 13:53:17,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:53:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:53:17,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856222454] [2022-04-27 13:53:17,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:53:17,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304760080] [2022-04-27 13:53:17,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304760080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:53:17,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:53:17,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:53:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477228386] [2022-04-27 13:53:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:53:17,618 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 13:53:17,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:53:17,618 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 13:53:17,635 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 13:53:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:53:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:53:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:53:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:53:17,636 INFO L87 Difference]: Start difference. First operand 35 states and 47 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 13:53:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,723 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-27 13:53:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:53:17,723 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 13:53:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:53:17,724 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 13:53:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 13:53:17,730 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 13:53:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 13:53:17,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-27 13:53:17,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:53:17,790 INFO L225 Difference]: With dead ends: 45 [2022-04-27 13:53:17,791 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 13:53:17,791 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 13:53:17,792 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:53:17,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:53:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 13:53:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 13:53:17,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:53:17,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,802 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,802 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,804 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-27 13:53:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-27 13:53:17,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:17,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:17,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-27 13:53:17,805 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-27 13:53:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:17,807 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-27 13:53:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-27 13:53:17,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:17,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:17,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:53:17,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:53:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:53:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-27 13:53:17,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 33 [2022-04-27 13:53:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:53:17,810 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-27 13:53:17,810 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 13:53:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-27 13:53:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:53:17,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:53:17,811 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 13:53:17,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:53:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:53:18,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:53:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:53:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 184052128, now seen corresponding path program 1 times [2022-04-27 13:53:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:53:18,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642160829] [2022-04-27 13:53:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:53:18,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:53:18,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475512245] [2022-04-27 13:53:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:18,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:53:18,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:53:18,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:53:18,068 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 13:53:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:18,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:53:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:53:18,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:53:18,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2022-04-27 13:53:18,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {592#true} is VALID [2022-04-27 13:53:18,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-27 13:53:18,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #111#return; {592#true} is VALID [2022-04-27 13:53:18,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret9 := main(); {592#true} is VALID [2022-04-27 13:53:18,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#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; {592#true} is VALID [2022-04-27 13:53:18,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {592#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {592#true} is VALID [2022-04-27 13:53:18,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#true} ~cond := #in~cond; {592#true} is VALID [2022-04-27 13:53:18,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {592#true} assume !(0 == ~cond); {592#true} is VALID [2022-04-27 13:53:18,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-27 13:53:18,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {592#true} {592#true} #93#return; {592#true} is VALID [2022-04-27 13:53:18,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {592#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {592#true} is VALID [2022-04-27 13:53:18,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#true} ~cond := #in~cond; {592#true} is VALID [2022-04-27 13:53:18,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#true} assume !(0 == ~cond); {592#true} is VALID [2022-04-27 13:53:18,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-27 13:53:18,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#true} {592#true} #95#return; {592#true} is VALID [2022-04-27 13:53:18,297 INFO L272 TraceCheckUtils]: 16: Hoare triple {592#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {592#true} is VALID [2022-04-27 13:53:18,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {592#true} ~cond := #in~cond; {592#true} is VALID [2022-04-27 13:53:18,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {592#true} assume !(0 == ~cond); {592#true} is VALID [2022-04-27 13:53:18,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-27 13:53:18,298 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {592#true} {592#true} #97#return; {592#true} is VALID [2022-04-27 13:53:18,298 INFO L272 TraceCheckUtils]: 21: Hoare triple {592#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {592#true} is VALID [2022-04-27 13:53:18,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {592#true} ~cond := #in~cond; {592#true} is VALID [2022-04-27 13:53:18,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {592#true} assume !(0 == ~cond); {592#true} is VALID [2022-04-27 13:53:18,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-27 13:53:18,298 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {592#true} {592#true} #99#return; {592#true} is VALID [2022-04-27 13:53:18,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {592#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:53:18,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:53:18,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:53:18,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:53:18,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:53:18,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {593#false} is VALID [2022-04-27 13:53:18,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {593#false} assume !false; {593#false} is VALID [2022-04-27 13:53:18,303 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 13:53:18,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:53:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:53:18,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642160829] [2022-04-27 13:53:18,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:53:18,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475512245] [2022-04-27 13:53:18,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475512245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:53:18,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:53:18,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:53:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325707575] [2022-04-27 13:53:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:53:18,307 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 13:53:18,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:53:18,307 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 13:53:18,324 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 13:53:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:53:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:53:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:53:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:53:18,326 INFO L87 Difference]: Start difference. First operand 37 states and 49 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 13:53:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:18,544 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-27 13:53:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:53:18,545 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 13:53:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:53:18,546 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 13:53:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-27 13:53:18,549 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 13:53:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-27 13:53:18,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2022-04-27 13:53:18,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:53:18,623 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:53:18,623 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 13:53:18,623 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 13:53:18,626 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:53:18,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:53:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 13:53:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-27 13:53:18,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:53:18,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:53:18,645 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:53:18,647 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:53:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:18,650 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-27 13:53:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-27 13:53:18,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:18,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:18,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 13:53:18,655 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-27 13:53:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:53:18,659 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-27 13:53:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-27 13:53:18,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:53:18,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:53:18,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:53:18,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:53:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:53:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2022-04-27 13:53:18,662 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 33 [2022-04-27 13:53:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:53:18,662 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2022-04-27 13:53:18,662 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 13:53:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-27 13:53:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:53:18,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:53:18,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-27 13:53:18,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 13:53:18,871 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 13:53:18,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:53:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:53:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash 758334593, now seen corresponding path program 1 times [2022-04-27 13:53:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:53:18,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523627662] [2022-04-27 13:53:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:53:18,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:53:18,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811798183] [2022-04-27 13:53:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:53:18,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:53:18,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:53:18,896 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 13:53:18,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process