/usr/bin/java -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/egcd2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 00:31:49,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 00:31:49,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 00:31:49,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 00:31:49,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 00:31:49,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 00:31:49,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 00:31:49,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 00:31:49,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 00:31:49,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 00:31:49,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 00:31:49,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 00:31:49,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 00:31:49,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 00:31:49,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 00:31:49,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 00:31:49,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 00:31:49,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 00:31:49,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 00:31:49,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 00:31:49,067 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 00:31:49,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 00:31:49,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 00:31:49,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 00:31:49,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 00:31:49,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 00:31:49,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 00:31:49,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 00:31:49,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 00:31:49,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 00:31:49,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 00:31:49,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 00:31:49,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 00:31:49,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 00:31:49,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 00:31:49,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 00:31:49,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 00:31:49,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 00:31:49,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 00:31:49,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 00:31:49,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 00:31:49,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 00:31:49,083 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-03-20 00:31:49,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 00:31:49,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 00:31:49,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 00:31:49,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 00:31:49,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 00:31:49,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 00:31:49,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 00:31:49,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 00:31:49,116 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 00:31:49,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 00:31:49,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 00:31:49,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 00:31:49,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 00:31:49,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 00:31:49,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 00:31:49,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 00:31:49,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 00:31:49,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 00:31:49,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 00:31:49,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 00:31:49,120 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 00:31:49,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 00:31:49,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 00:31:49,120 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-03-20 00:31:49,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 00:31:49,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 00:31:49,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 00:31:49,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 00:31:49,393 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 00:31:49,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-03-20 00:31:49,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751a84b84/cef517f551fe4e7390f6f373a0c7fdf4/FLAGfcca92a75 [2022-03-20 00:31:49,845 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 00:31:49,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-03-20 00:31:49,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751a84b84/cef517f551fe4e7390f6f373a0c7fdf4/FLAGfcca92a75 [2022-03-20 00:31:50,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751a84b84/cef517f551fe4e7390f6f373a0c7fdf4 [2022-03-20 00:31:50,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 00:31:50,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 00:31:50,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 00:31:50,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 00:31:50,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 00:31:50,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b560c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50, skipping insertion in model container [2022-03-20 00:31:50,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 00:31:50,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 00:31:50,446 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/egcd2-ll_unwindbound20.c[490,503] [2022-03-20 00:31:50,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 00:31:50,469 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 00:31:50,479 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/egcd2-ll_unwindbound20.c[490,503] [2022-03-20 00:31:50,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 00:31:50,497 INFO L208 MainTranslator]: Completed translation [2022-03-20 00:31:50,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50 WrapperNode [2022-03-20 00:31:50,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 00:31:50,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 00:31:50,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 00:31:50,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 00:31:50,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 00:31:50,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 00:31:50,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 00:31:50,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 00:31:50,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (1/1) ... [2022-03-20 00:31:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 00:31:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:50,554 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-03-20 00:31:50,564 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-03-20 00:31:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 00:31:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 00:31:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 00:31:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 00:31:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 00:31:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 00:31:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 00:31:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 00:31:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 00:31:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 00:31:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 00:31:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 00:31:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 00:31:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 00:31:50,651 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 00:31:50,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 00:31:50,821 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 00:31:50,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 00:31:50,839 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 00:31:50,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:31:50 BoogieIcfgContainer [2022-03-20 00:31:50,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 00:31:50,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 00:31:50,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 00:31:50,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 00:31:50,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 12:31:50" (1/3) ... [2022-03-20 00:31:50,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32199b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:31:50, skipping insertion in model container [2022-03-20 00:31:50,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:31:50" (2/3) ... [2022-03-20 00:31:50,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32199b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:31:50, skipping insertion in model container [2022-03-20 00:31:50,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:31:50" (3/3) ... [2022-03-20 00:31:50,861 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound20.c [2022-03-20 00:31:50,865 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 00:31:50,865 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 00:31:50,938 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 00:31:50,961 INFO L340 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 [2022-03-20 00:31:50,961 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 00:31:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 00:31:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-20 00:31:50,989 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:50,990 INFO L499 BasicCegarLoop]: 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-03-20 00:31:50,990 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-03-20 00:31:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:51,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686627083] [2022-03-20 00:31:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 00:31:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 00:31:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 00:31:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 00:31:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 00:31:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:31:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:51,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686627083] [2022-03-20 00:31:51,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686627083] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:31:51,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:31:51,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 00:31:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957033681] [2022-03-20 00:31:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:51,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 00:31:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 00:31:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 00:31:51,308 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-03-20 00:31:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:51,434 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-03-20 00:31:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 00:31:51,437 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-03-20 00:31:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:51,447 INFO L225 Difference]: With dead ends: 72 [2022-03-20 00:31:51,447 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 00:31:51,452 INFO L912 BasicCegarLoop]: 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-03-20 00:31:51,456 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:51,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:31:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 00:31:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-03-20 00:31:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 00:31:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-03-20 00:31:51,507 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-03-20 00:31:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:51,508 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-03-20 00:31:51,508 INFO L479 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-03-20 00:31:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-03-20 00:31:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 00:31:51,511 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:51,512 INFO L499 BasicCegarLoop]: 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-03-20 00:31:51,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 00:31:51,513 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-03-20 00:31:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115643057] [2022-03-20 00:31:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:51,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:51,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601671768] [2022-03-20 00:31:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:51,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:51,559 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-03-20 00:31:51,560 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-03-20 00:31:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 00:31:51,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:31:51,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:31:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:51,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115643057] [2022-03-20 00:31:51,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:51,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601671768] [2022-03-20 00:31:51,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601671768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:31:51,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:31:51,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 00:31:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112549047] [2022-03-20 00:31:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:51,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 00:31:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 00:31:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 00:31:51,780 INFO L87 Difference]: Start difference. First operand 34 states and 45 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-03-20 00:31:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:51,798 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-03-20 00:31:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 00:31:51,800 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-03-20 00:31:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:51,801 INFO L225 Difference]: With dead ends: 44 [2022-03-20 00:31:51,801 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 00:31:51,802 INFO L912 BasicCegarLoop]: 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-03-20 00:31:51,804 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:51,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 00:31:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-20 00:31:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 00:31:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-03-20 00:31:51,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-03-20 00:31:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:51,813 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-03-20 00:31:51,813 INFO L479 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-03-20 00:31:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-03-20 00:31:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 00:31:51,814 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:51,814 INFO L499 BasicCegarLoop]: 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, 1] [2022-03-20 00:31:51,841 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-03-20 00:31:52,035 WARN L460 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-03-20 00:31:52,036 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-03-20 00:31:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:52,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601204382] [2022-03-20 00:31:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:52,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443182801] [2022-03-20 00:31:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:52,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:52,053 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-03-20 00:31:52,062 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-03-20 00:31:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:52,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 00:31:52,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:31:52,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:31:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601204382] [2022-03-20 00:31:52,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443182801] [2022-03-20 00:31:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443182801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:31:52,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:31:52,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-03-20 00:31:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991653387] [2022-03-20 00:31:52,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:52,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 00:31:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 00:31:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 00:31:52,296 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 00:31:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:52,368 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-03-20 00:31:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 00:31:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-03-20 00:31:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:52,370 INFO L225 Difference]: With dead ends: 53 [2022-03-20 00:31:52,370 INFO L226 Difference]: Without dead ends: 45 [2022-03-20 00:31:52,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:31:52,372 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:52,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-20 00:31:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-03-20 00:31:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 00:31:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-03-20 00:31:52,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-03-20 00:31:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:52,381 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-03-20 00:31:52,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 00:31:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-03-20 00:31:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-20 00:31:52,382 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:52,382 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-03-20 00:31:52,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 00:31:52,595 WARN L460 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-03-20 00:31:52,596 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-03-20 00:31:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:52,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487361325] [2022-03-20 00:31:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:52,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:52,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028400014] [2022-03-20 00:31:52,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:52,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:52,613 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-03-20 00:31:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 00:31:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:31:52,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:31:52,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:31:52,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487361325] [2022-03-20 00:31:52,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028400014] [2022-03-20 00:31:52,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028400014] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:31:52,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:31:52,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-03-20 00:31:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813675342] [2022-03-20 00:31:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:52,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:31:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:31:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:31:52,920 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-03-20 00:31:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:52,961 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-03-20 00:31:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:31:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 36 [2022-03-20 00:31:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:52,963 INFO L225 Difference]: With dead ends: 43 [2022-03-20 00:31:52,963 INFO L226 Difference]: Without dead ends: 41 [2022-03-20 00:31:52,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-20 00:31:52,964 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:52,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-20 00:31:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-20 00:31:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 00:31:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-03-20 00:31:52,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-03-20 00:31:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:52,973 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-03-20 00:31:52,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-03-20 00:31:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-03-20 00:31:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 00:31:52,974 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:52,974 INFO L499 BasicCegarLoop]: 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-03-20 00:31:53,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:53,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:53,188 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-03-20 00:31:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:53,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537732813] [2022-03-20 00:31:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:53,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:53,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218801134] [2022-03-20 00:31:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:53,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:53,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 00:31:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:53,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 00:31:53,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:31:53,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:31:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:53,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537732813] [2022-03-20 00:31:53,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:53,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218801134] [2022-03-20 00:31:53,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218801134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:31:53,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:31:53,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 00:31:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419648362] [2022-03-20 00:31:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:53,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:31:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:31:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 00:31:53,406 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-20 00:31:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:53,433 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-03-20 00:31:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:31:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 39 [2022-03-20 00:31:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:53,434 INFO L225 Difference]: With dead ends: 66 [2022-03-20 00:31:53,434 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 00:31:53,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 00:31:53,435 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:53,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 00:31:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-03-20 00:31:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 00:31:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-03-20 00:31:53,443 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-03-20 00:31:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:53,443 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-03-20 00:31:53,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-20 00:31:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-03-20 00:31:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 00:31:53,444 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:53,445 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-03-20 00:31:53,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 00:31:53,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:53,658 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-03-20 00:31:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:53,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078441329] [2022-03-20 00:31:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:53,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:53,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930595473] [2022-03-20 00:31:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:53,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:53,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 00:31:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:53,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:31:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:31:53,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:31:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:54,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078441329] [2022-03-20 00:31:54,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:54,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930595473] [2022-03-20 00:31:54,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930595473] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:31:54,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:31:54,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-20 00:31:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549471607] [2022-03-20 00:31:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:54,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:31:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:31:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:31:54,004 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 00:31:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:54,037 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-03-20 00:31:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:31:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-03-20 00:31:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:54,039 INFO L225 Difference]: With dead ends: 57 [2022-03-20 00:31:54,039 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 00:31:54,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:31:54,040 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:54,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 00:31:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-03-20 00:31:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 00:31:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-03-20 00:31:54,048 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-03-20 00:31:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:54,049 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-03-20 00:31:54,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 00:31:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-03-20 00:31:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 00:31:54,050 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:54,050 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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-03-20 00:31:54,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:54,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:54,268 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-03-20 00:31:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:54,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638288005] [2022-03-20 00:31:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:54,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:54,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1372144384] [2022-03-20 00:31:54,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:54,287 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:54,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 00:31:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:54,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:31:54,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 00:31:54,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 00:31:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638288005] [2022-03-20 00:31:54,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372144384] [2022-03-20 00:31:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372144384] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:31:54,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:31:54,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-20 00:31:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359532899] [2022-03-20 00:31:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:31:54,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:31:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:31:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:31:54,606 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 00:31:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:54,657 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-03-20 00:31:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:31:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-03-20 00:31:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:54,661 INFO L225 Difference]: With dead ends: 61 [2022-03-20 00:31:54,661 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 00:31:54,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:31:54,663 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:54,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:31:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 00:31:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-03-20 00:31:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 00:31:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-03-20 00:31:54,678 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-03-20 00:31:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:54,678 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-03-20 00:31:54,679 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 00:31:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-03-20 00:31:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 00:31:54,680 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:54,680 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:31:54,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:54,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:54,896 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-03-20 00:31:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:54,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740930186] [2022-03-20 00:31:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:54,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:54,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492158648] [2022-03-20 00:31:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:54,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:54,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:54,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:54,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 00:31:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:54,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 00:31:54,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-20 00:31:55,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:55,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740930186] [2022-03-20 00:31:55,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492158648] [2022-03-20 00:31:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492158648] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:31:55,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:31:55,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-03-20 00:31:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669834125] [2022-03-20 00:31:55,346 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:55,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:31:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:31:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-20 00:31:55,347 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 00:31:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:55,510 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-03-20 00:31:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 00:31:55,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-03-20 00:31:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:55,514 INFO L225 Difference]: With dead ends: 65 [2022-03-20 00:31:55,514 INFO L226 Difference]: Without dead ends: 63 [2022-03-20 00:31:55,514 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-20 00:31:55,515 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:55,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:31:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-20 00:31:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-03-20 00:31:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 00:31:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-03-20 00:31:55,530 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-03-20 00:31:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:55,530 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-03-20 00:31:55,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 00:31:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-03-20 00:31:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-20 00:31:55,537 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:55,538 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:31:55,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:55,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:55,752 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-03-20 00:31:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:55,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774811954] [2022-03-20 00:31:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:55,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:55,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746016525] [2022-03-20 00:31:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:55,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:55,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 00:31:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:31:55,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:31:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:31:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:56,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774811954] [2022-03-20 00:31:56,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:56,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746016525] [2022-03-20 00:31:56,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746016525] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:31:56,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:31:56,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-20 00:31:56,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342201316] [2022-03-20 00:31:56,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:56,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:31:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:56,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:31:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:31:56,063 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 00:31:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:56,228 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-03-20 00:31:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:31:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-03-20 00:31:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:56,231 INFO L225 Difference]: With dead ends: 215 [2022-03-20 00:31:56,231 INFO L226 Difference]: Without dead ends: 207 [2022-03-20 00:31:56,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-20 00:31:56,234 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 84 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:56,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:31:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-03-20 00:31:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-03-20 00:31:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-03-20 00:31:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-03-20 00:31:56,271 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-03-20 00:31:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:56,271 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-03-20 00:31:56,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 00:31:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-03-20 00:31:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 00:31:56,273 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:56,274 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:31:56,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:56,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-20 00:31:56,488 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-03-20 00:31:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:56,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927087397] [2022-03-20 00:31:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:56,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:56,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568382276] [2022-03-20 00:31:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:56,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:56,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 00:31:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:56,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:31:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 00:31:56,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 00:31:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927087397] [2022-03-20 00:31:56,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568382276] [2022-03-20 00:31:56,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568382276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:31:56,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:31:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-20 00:31:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643384662] [2022-03-20 00:31:56,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:56,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 00:31:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 00:31:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:31:56,828 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-03-20 00:31:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:57,001 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-03-20 00:31:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 00:31:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-03-20 00:31:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:57,005 INFO L225 Difference]: With dead ends: 283 [2022-03-20 00:31:57,005 INFO L226 Difference]: Without dead ends: 263 [2022-03-20 00:31:57,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-20 00:31:57,008 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:57,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 451 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:31:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-03-20 00:31:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-03-20 00:31:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-03-20 00:31:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-03-20 00:31:57,060 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-03-20 00:31:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:57,061 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-03-20 00:31:57,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-03-20 00:31:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-03-20 00:31:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 00:31:57,062 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:57,062 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-03-20 00:31:57,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:57,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-20 00:31:57,287 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-03-20 00:31:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:57,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500691275] [2022-03-20 00:31:57,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:57,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090346033] [2022-03-20 00:31:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:57,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:57,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:57,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:57,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 00:31:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:57,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:31:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:31:57,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:31:57,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:57,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500691275] [2022-03-20 00:31:57,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:57,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090346033] [2022-03-20 00:31:57,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090346033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:31:57,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:31:57,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-20 00:31:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235485572] [2022-03-20 00:31:57,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:57,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:31:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:31:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:31:57,637 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 00:31:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:57,801 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-03-20 00:31:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:31:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-03-20 00:31:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:57,804 INFO L225 Difference]: With dead ends: 348 [2022-03-20 00:31:57,804 INFO L226 Difference]: Without dead ends: 252 [2022-03-20 00:31:57,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-03-20 00:31:57,805 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 100 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:57,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 207 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:31:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-03-20 00:31:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-03-20 00:31:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-03-20 00:31:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-03-20 00:31:57,825 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-03-20 00:31:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:57,825 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-03-20 00:31:57,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 00:31:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-03-20 00:31:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 00:31:57,826 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:57,826 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:31:57,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:58,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-20 00:31:58,050 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-03-20 00:31:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699895124] [2022-03-20 00:31:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:58,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085659384] [2022-03-20 00:31:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:58,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:58,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:58,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:58,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 00:31:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:31:58,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-20 00:31:58,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 00:31:58,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:31:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 00:31:58,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:31:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699895124] [2022-03-20 00:31:58,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:31:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085659384] [2022-03-20 00:31:58,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085659384] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:31:58,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:31:58,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-03-20 00:31:58,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377918644] [2022-03-20 00:31:58,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:31:58,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 00:31:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:31:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 00:31:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-20 00:31:58,541 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-20 00:31:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:31:58,987 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-03-20 00:31:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 00:31:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-03-20 00:31:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:31:58,995 INFO L225 Difference]: With dead ends: 334 [2022-03-20 00:31:58,995 INFO L226 Difference]: Without dead ends: 328 [2022-03-20 00:31:58,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-03-20 00:31:58,996 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 00:31:58,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 357 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 00:31:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-20 00:31:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-03-20 00:31:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-03-20 00:31:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-03-20 00:31:59,025 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-03-20 00:31:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:31:59,025 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-03-20 00:31:59,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-20 00:31:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-03-20 00:31:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-20 00:31:59,026 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:31:59,027 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:31:59,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 00:31:59,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-20 00:31:59,256 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:31:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:31:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-03-20 00:31:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:31:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928382478] [2022-03-20 00:31:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:31:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:31:59,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:31:59,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939816454] [2022-03-20 00:31:59,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:31:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:31:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:31:59,275 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:31:59,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 00:31:59,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:31:59,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:31:59,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-20 00:31:59,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:31:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-20 00:31:59,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-20 00:32:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928382478] [2022-03-20 00:32:00,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939816454] [2022-03-20 00:32:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939816454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:00,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-03-20 00:32:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065178909] [2022-03-20 00:32:00,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:00,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 00:32:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 00:32:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-20 00:32:00,080 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-20 00:32:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:01,530 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-03-20 00:32:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:32:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-03-20 00:32:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:01,533 INFO L225 Difference]: With dead ends: 319 [2022-03-20 00:32:01,533 INFO L226 Difference]: Without dead ends: 316 [2022-03-20 00:32:01,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-03-20 00:32:01,534 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:01,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 401 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 00:32:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-03-20 00:32:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-03-20 00:32:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-03-20 00:32:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-03-20 00:32:01,563 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-03-20 00:32:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:01,564 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-03-20 00:32:01,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-20 00:32:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-03-20 00:32:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 00:32:01,565 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:01,565 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:01,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:01,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 00:32:01,790 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-03-20 00:32:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:01,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780019919] [2022-03-20 00:32:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:01,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312094448] [2022-03-20 00:32:01,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:32:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:01,810 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:01,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 00:32:01,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 00:32:01,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:01,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-20 00:32:01,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-03-20 00:32:02,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:02,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780019919] [2022-03-20 00:32:02,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:02,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312094448] [2022-03-20 00:32:02,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312094448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:02,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:02,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 00:32:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777169594] [2022-03-20 00:32:02,454 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:02,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 00:32:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 00:32:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-20 00:32:02,455 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 00:32:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:02,714 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-03-20 00:32:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 00:32:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-03-20 00:32:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:02,722 INFO L225 Difference]: With dead ends: 337 [2022-03-20 00:32:02,722 INFO L226 Difference]: Without dead ends: 333 [2022-03-20 00:32:02,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-20 00:32:02,723 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:02,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 281 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 00:32:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-03-20 00:32:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-03-20 00:32:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-03-20 00:32:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-03-20 00:32:02,754 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-03-20 00:32:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:02,754 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-03-20 00:32:02,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 00:32:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-03-20 00:32:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-03-20 00:32:02,755 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:02,755 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:02,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:02,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 00:32:02,972 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-03-20 00:32:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346957148] [2022-03-20 00:32:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:02,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572358588] [2022-03-20 00:32:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:03,007 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:03,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 00:32:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:03,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-20 00:32:03,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-20 00:32:03,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-20 00:32:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:04,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346957148] [2022-03-20 00:32:04,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:04,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572358588] [2022-03-20 00:32:04,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572358588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:04,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:04,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-03-20 00:32:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512292781] [2022-03-20 00:32:04,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:04,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 00:32:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 00:32:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-03-20 00:32:04,128 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-20 00:32:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:06,651 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-03-20 00:32:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-20 00:32:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-03-20 00:32:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:06,654 INFO L225 Difference]: With dead ends: 392 [2022-03-20 00:32:06,654 INFO L226 Difference]: Without dead ends: 377 [2022-03-20 00:32:06,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-03-20 00:32:06,655 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:06,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 495 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-20 00:32:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-03-20 00:32:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-03-20 00:32:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-03-20 00:32:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-03-20 00:32:06,704 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-03-20 00:32:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:06,704 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-03-20 00:32:06,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-20 00:32:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-03-20 00:32:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-20 00:32:06,705 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:06,705 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:06,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:06,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:06,925 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-03-20 00:32:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:06,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892111044] [2022-03-20 00:32:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:06,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730311660] [2022-03-20 00:32:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:06,935 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:06,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-20 00:32:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:06,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-20 00:32:06,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-03-20 00:32:07,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:08,236 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892111044] [2022-03-20 00:32:09,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730311660] [2022-03-20 00:32:09,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730311660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:09,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:09,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-03-20 00:32:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826209246] [2022-03-20 00:32:09,601 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:09,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 00:32:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 00:32:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-20 00:32:09,602 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-03-20 00:32:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:10,246 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-03-20 00:32:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 00:32:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-03-20 00:32:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:10,249 INFO L225 Difference]: With dead ends: 377 [2022-03-20 00:32:10,249 INFO L226 Difference]: Without dead ends: 375 [2022-03-20 00:32:10,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 00:32:10,250 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:10,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 438 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 00:32:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-03-20 00:32:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-03-20 00:32:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-03-20 00:32:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-03-20 00:32:10,298 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-03-20 00:32:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:10,299 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-03-20 00:32:10,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-03-20 00:32:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-03-20 00:32:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-20 00:32:10,300 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:10,300 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:10,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:10,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 00:32:10,516 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2076615365, now seen corresponding path program 4 times [2022-03-20 00:32:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036409387] [2022-03-20 00:32:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:10,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707218885] [2022-03-20 00:32:10,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 00:32:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:10,526 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:10,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-20 00:32:10,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 00:32:10,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:10,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 00:32:10,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-03-20 00:32:10,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:32:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036409387] [2022-03-20 00:32:10,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707218885] [2022-03-20 00:32:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707218885] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:32:10,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:32:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 00:32:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226481029] [2022-03-20 00:32:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:10,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 00:32:10,711 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-03-20 00:32:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:10,813 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-03-20 00:32:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 00:32:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-03-20 00:32:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:10,816 INFO L225 Difference]: With dead ends: 535 [2022-03-20 00:32:10,816 INFO L226 Difference]: Without dead ends: 417 [2022-03-20 00:32:10,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-20 00:32:10,818 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:10,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-03-20 00:32:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-03-20 00:32:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-03-20 00:32:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-03-20 00:32:10,881 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-03-20 00:32:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:10,881 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-03-20 00:32:10,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-03-20 00:32:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-03-20 00:32:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-20 00:32:10,883 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:10,883 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:10,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:11,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-20 00:32:11,095 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 1 times [2022-03-20 00:32:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235841090] [2022-03-20 00:32:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:11,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:11,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556002672] [2022-03-20 00:32:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:11,105 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:11,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-20 00:32:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:11,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-20 00:32:11,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-20 00:32:11,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-03-20 00:32:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:11,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235841090] [2022-03-20 00:32:11,603 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:11,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556002672] [2022-03-20 00:32:11,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556002672] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:11,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:11,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-20 00:32:11,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542223185] [2022-03-20 00:32:11,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:11,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 00:32:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 00:32:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-20 00:32:11,604 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-03-20 00:32:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:12,197 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-03-20 00:32:12,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 00:32:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-03-20 00:32:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:12,204 INFO L225 Difference]: With dead ends: 1393 [2022-03-20 00:32:12,204 INFO L226 Difference]: Without dead ends: 1260 [2022-03-20 00:32:12,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-03-20 00:32:12,205 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 318 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:12,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 456 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 00:32:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-03-20 00:32:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-03-20 00:32:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-03-20 00:32:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-03-20 00:32:12,372 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-03-20 00:32:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:12,373 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-03-20 00:32:12,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-03-20 00:32:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-03-20 00:32:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-20 00:32:12,374 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:12,375 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:32:12,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:12,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 00:32:12,588 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 2 times [2022-03-20 00:32:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:12,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599821676] [2022-03-20 00:32:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:12,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:12,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228302751] [2022-03-20 00:32:12,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:32:12,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:12,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:12,600 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:12,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 00:32:12,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:32:12,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:12,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-20 00:32:12,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:16,033 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-03-20 00:32:18,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:30,459 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:39,246 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 136 proven. 86 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-03-20 00:32:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:51,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599821676] [2022-03-20 00:32:51,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:51,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228302751] [2022-03-20 00:32:51,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228302751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:51,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:51,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-03-20 00:32:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563867646] [2022-03-20 00:32:51,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:51,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-20 00:32:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-20 00:32:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=635, Unknown=6, NotChecked=0, Total=812 [2022-03-20 00:32:51,096 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-20 00:32:54,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:32:56,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:32:58,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:32:59,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:04,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:15,074 WARN L232 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 127 DAG size of output: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:33:23,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:27,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:29,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:31,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:33,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:35,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:37,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:39,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:42,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:44,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:46,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:48,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:57,933 WARN L232 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:34:28,021 WARN L232 SmtUtils]: Spent 28.88s on a formula simplification. DAG size of input: 109 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:34:31,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:37,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:42,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:44,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:46,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:47,811 WARN L232 SmtUtils]: Spent 57.66s on a formula simplification. DAG size of input: 129 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:35:49,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:51,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:53,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:00,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:02,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:07,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:10,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:25,058 WARN L232 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 52 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:36:27,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:29,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:31,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:00,223 WARN L232 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 147 DAG size of output: 145 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:38:01,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:04,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:06,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:09,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:13,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:38:26,150 WARN L232 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 128 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:38:34,438 WARN L232 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 87 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:39:41,903 WARN L232 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 110 DAG size of output: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:39:43,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:45,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:47,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:43,811 WARN L232 SmtUtils]: Spent 54.50s on a formula simplification. DAG size of input: 146 DAG size of output: 145 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:40:45,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:48,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:52,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:54,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:56,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:40:59,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:01,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:03,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:05,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:07,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:09,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:11,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:13,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:16,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:18,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:20,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:22,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:24,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:26,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:28,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:30,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:41:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:41:30,080 INFO L93 Difference]: Finished difference Result 1626 states and 2111 transitions. [2022-03-20 00:41:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-20 00:41:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) Word has length 124 [2022-03-20 00:41:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:41:30,087 INFO L225 Difference]: With dead ends: 1626 [2022-03-20 00:41:30,087 INFO L226 Difference]: Without dead ends: 1624 [2022-03-20 00:41:30,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 405.4s TimeCoverageRelationStatistics Valid=613, Invalid=2027, Unknown=12, NotChecked=0, Total=2652 [2022-03-20 00:41:30,089 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 216 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 300 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 142.6s IncrementalHoareTripleChecker+Time [2022-03-20 00:41:30,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 746 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1064 Invalid, 54 Unknown, 0 Unchecked, 142.6s Time] [2022-03-20 00:41:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-03-20 00:41:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1545. [2022-03-20 00:41:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 972 states have (on average 1.1779835390946503) internal successors, (1145), 988 states have internal predecessors, (1145), 430 states have call successors, (430), 143 states have call predecessors, (430), 142 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-03-20 00:41:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1996 transitions. [2022-03-20 00:41:30,470 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1996 transitions. Word has length 124 [2022-03-20 00:41:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:41:30,471 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1996 transitions. [2022-03-20 00:41:30,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-20 00:41:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1996 transitions. [2022-03-20 00:41:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-20 00:41:30,472 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:41:30,473 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:41:30,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-20 00:41:30,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:41:30,691 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:41:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:41:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 3 times [2022-03-20 00:41:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:41:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508154735] [2022-03-20 00:41:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:41:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:41:30,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:41:30,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603018153] [2022-03-20 00:41:30,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:41:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:41:30,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:41:30,701 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:41:30,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-20 00:41:30,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 00:41:30,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:41:30,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-20 00:41:30,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:41:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-20 00:41:31,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:41:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 56 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-20 00:41:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:41:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508154735] [2022-03-20 00:41:51,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:41:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603018153] [2022-03-20 00:41:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603018153] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:41:51,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:41:51,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-03-20 00:41:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352214737] [2022-03-20 00:41:51,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:41:51,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 00:41:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:41:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 00:41:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=355, Unknown=2, NotChecked=0, Total=462 [2022-03-20 00:41:51,538 INFO L87 Difference]: Start difference. First operand 1545 states and 1996 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-03-20 00:42:05,971 WARN L232 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:42:13,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:15,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:21,888 WARN L232 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:42:27,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:29,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:31,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:34,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:36,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:38,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:46,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:48,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:50,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:52,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:54,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:56,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:42:58,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:00,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:03,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:05,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:07,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:08,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:43:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:09,396 INFO L93 Difference]: Finished difference Result 2003 states and 2664 transitions. [2022-03-20 00:43:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-20 00:43:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-03-20 00:43:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:09,404 INFO L225 Difference]: With dead ends: 2003 [2022-03-20 00:43:09,404 INFO L226 Difference]: Without dead ends: 1987 [2022-03-20 00:43:09,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=391, Invalid=1089, Unknown=2, NotChecked=0, Total=1482 [2022-03-20 00:43:09,405 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 176 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 182 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:09,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 717 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 893 Invalid, 16 Unknown, 0 Unchecked, 47.2s Time] [2022-03-20 00:43:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-03-20 00:43:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1756. [2022-03-20 00:43:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1118 states have (on average 1.1914132379248659) internal successors, (1332), 1130 states have internal predecessors, (1332), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-20 00:43:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2293 transitions. [2022-03-20 00:43:09,938 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2293 transitions. Word has length 128 [2022-03-20 00:43:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:09,938 INFO L478 AbstractCegarLoop]: Abstraction has 1756 states and 2293 transitions. [2022-03-20 00:43:09,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-03-20 00:43:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2293 transitions. [2022-03-20 00:43:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-20 00:43:09,940 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:09,940 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:09,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-20 00:43:10,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:10,155 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 1 times [2022-03-20 00:43:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:10,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949278111] [2022-03-20 00:43:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:10,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:10,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454397062] [2022-03-20 00:43:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:10,166 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:43:10,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-20 00:43:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:43:10,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-20 00:43:10,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:43:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-03-20 00:43:10,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:43:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-03-20 00:43:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:43:10,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949278111] [2022-03-20 00:43:10,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:43:10,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454397062] [2022-03-20 00:43:10,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454397062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:43:10,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:43:10,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-20 00:43:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055581156] [2022-03-20 00:43:10,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:43:10,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 00:43:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:43:10,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 00:43:10,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-20 00:43:10,709 INFO L87 Difference]: Start difference. First operand 1756 states and 2293 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-20 00:43:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:11,504 INFO L93 Difference]: Finished difference Result 1819 states and 2355 transitions. [2022-03-20 00:43:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 00:43:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-03-20 00:43:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:11,511 INFO L225 Difference]: With dead ends: 1819 [2022-03-20 00:43:11,511 INFO L226 Difference]: Without dead ends: 1809 [2022-03-20 00:43:11,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-03-20 00:43:11,512 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 280 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:11,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 339 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 00:43:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-03-20 00:43:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1777. [2022-03-20 00:43:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1139 states have (on average 1.160667251975417) internal successors, (1322), 1151 states have internal predecessors, (1322), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-20 00:43:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2283 transitions. [2022-03-20 00:43:12,062 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2283 transitions. Word has length 133 [2022-03-20 00:43:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:12,062 INFO L478 AbstractCegarLoop]: Abstraction has 1777 states and 2283 transitions. [2022-03-20 00:43:12,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-20 00:43:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2283 transitions. [2022-03-20 00:43:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-20 00:43:12,064 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:12,064 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:12,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-20 00:43:12,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-20 00:43:12,287 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 2 times [2022-03-20 00:43:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:12,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007151571] [2022-03-20 00:43:12,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:12,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:12,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181757283] [2022-03-20 00:43:12,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:43:12,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:12,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:12,298 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:43:12,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-20 00:43:12,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:43:12,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:43:12,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-20 00:43:12,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:43:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-03-20 00:43:14,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:43:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-03-20 00:43:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:43:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007151571] [2022-03-20 00:43:15,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:43:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181757283] [2022-03-20 00:43:15,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181757283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:43:15,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:43:15,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-03-20 00:43:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083889636] [2022-03-20 00:43:15,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:43:15,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 00:43:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:43:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 00:43:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-03-20 00:43:15,838 INFO L87 Difference]: Start difference. First operand 1777 states and 2283 transitions. Second operand has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-03-20 00:43:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:21,862 INFO L93 Difference]: Finished difference Result 1899 states and 2421 transitions. [2022-03-20 00:43:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-20 00:43:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 134 [2022-03-20 00:43:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:21,869 INFO L225 Difference]: With dead ends: 1899 [2022-03-20 00:43:21,869 INFO L226 Difference]: Without dead ends: 1888 [2022-03-20 00:43:21,870 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-03-20 00:43:21,870 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 135 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:21,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 601 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-20 00:43:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-03-20 00:43:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1729. [2022-03-20 00:43:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1098 states have (on average 1.138433515482696) internal successors, (1250), 1113 states have internal predecessors, (1250), 461 states have call successors, (461), 170 states have call predecessors, (461), 169 states have return successors, (459), 445 states have call predecessors, (459), 459 states have call successors, (459) [2022-03-20 00:43:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2170 transitions. [2022-03-20 00:43:22,450 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2170 transitions. Word has length 134 [2022-03-20 00:43:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:22,452 INFO L478 AbstractCegarLoop]: Abstraction has 1729 states and 2170 transitions. [2022-03-20 00:43:22,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-03-20 00:43:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2170 transitions. [2022-03-20 00:43:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-03-20 00:43:22,459 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:22,459 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:22,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-20 00:43:22,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-20 00:43:22,671 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2083543191, now seen corresponding path program 2 times [2022-03-20 00:43:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:22,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013550583] [2022-03-20 00:43:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:22,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:22,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827997476] [2022-03-20 00:43:22,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:43:22,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:22,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:22,692 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:43:22,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-20 00:43:22,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:43:22,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:43:22,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 00:43:22,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:43:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-20 00:43:23,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:43:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-20 00:43:23,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:43:23,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013550583] [2022-03-20 00:43:23,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:43:23,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827997476] [2022-03-20 00:43:23,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827997476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:43:23,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:43:23,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-03-20 00:43:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613747449] [2022-03-20 00:43:23,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:43:23,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 00:43:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:43:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 00:43:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 00:43:23,719 INFO L87 Difference]: Start difference. First operand 1729 states and 2170 transitions. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-03-20 00:43:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:25,152 INFO L93 Difference]: Finished difference Result 3224 states and 4249 transitions. [2022-03-20 00:43:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-20 00:43:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) Word has length 260 [2022-03-20 00:43:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:25,162 INFO L225 Difference]: With dead ends: 3224 [2022-03-20 00:43:25,162 INFO L226 Difference]: Without dead ends: 3215 [2022-03-20 00:43:25,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2022-03-20 00:43:25,164 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 260 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:25,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 476 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 00:43:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-03-20 00:43:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3129. [2022-03-20 00:43:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 2007 states have (on average 1.1778774289985052) internal successors, (2364), 2045 states have internal predecessors, (2364), 853 states have call successors, (853), 270 states have call predecessors, (853), 268 states have return successors, (847), 813 states have call predecessors, (847), 847 states have call successors, (847) [2022-03-20 00:43:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4064 transitions. [2022-03-20 00:43:26,220 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4064 transitions. Word has length 260 [2022-03-20 00:43:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:26,221 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 4064 transitions. [2022-03-20 00:43:26,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-03-20 00:43:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4064 transitions. [2022-03-20 00:43:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-03-20 00:43:26,226 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:26,226 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:26,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-20 00:43:26,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:26,439 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 996673892, now seen corresponding path program 1 times [2022-03-20 00:43:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665916183] [2022-03-20 00:43:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:26,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654587884] [2022-03-20 00:43:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:26,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:26,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:26,458 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:43:26,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-20 00:43:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:43:26,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 00:43:26,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:43:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-20 00:43:27,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:43:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-20 00:43:27,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:43:27,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665916183] [2022-03-20 00:43:27,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:43:27,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654587884] [2022-03-20 00:43:27,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654587884] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:43:27,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:43:27,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-03-20 00:43:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627116571] [2022-03-20 00:43:27,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:43:27,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 00:43:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:43:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 00:43:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 00:43:27,497 INFO L87 Difference]: Start difference. First operand 3129 states and 4064 transitions. Second operand has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 19 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 17 states have call predecessors, (82), 18 states have call successors, (82) [2022-03-20 00:43:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:28,865 INFO L93 Difference]: Finished difference Result 3560 states and 4679 transitions. [2022-03-20 00:43:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-20 00:43:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 19 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 17 states have call predecessors, (82), 18 states have call successors, (82) Word has length 263 [2022-03-20 00:43:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:28,875 INFO L225 Difference]: With dead ends: 3560 [2022-03-20 00:43:28,876 INFO L226 Difference]: Without dead ends: 2791 [2022-03-20 00:43:28,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=628, Invalid=1094, Unknown=0, NotChecked=0, Total=1722 [2022-03-20 00:43:28,879 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 366 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:28,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 552 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 00:43:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-03-20 00:43:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2683. [2022-03-20 00:43:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 1668 states have (on average 1.1235011990407673) internal successors, (1874), 1689 states have internal predecessors, (1874), 749 states have call successors, (749), 266 states have call predecessors, (749), 265 states have return successors, (747), 727 states have call predecessors, (747), 747 states have call successors, (747) [2022-03-20 00:43:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3370 transitions. [2022-03-20 00:43:29,659 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3370 transitions. Word has length 263 [2022-03-20 00:43:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:29,660 INFO L478 AbstractCegarLoop]: Abstraction has 2683 states and 3370 transitions. [2022-03-20 00:43:29,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 19 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 17 states have call predecessors, (82), 18 states have call successors, (82) [2022-03-20 00:43:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3370 transitions. [2022-03-20 00:43:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-03-20 00:43:29,670 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:29,670 INFO L499 BasicCegarLoop]: trace histogram [53, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:29,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-20 00:43:29,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:29,879 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1569408421, now seen corresponding path program 3 times [2022-03-20 00:43:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125060019] [2022-03-20 00:43:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:29,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492043952] [2022-03-20 00:43:29,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:43:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:29,892 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:43:29,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-20 00:45:01,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-03-20 00:45:01,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-20 00:45:01,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 00:45:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 00:45:03,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 00:45:03,972 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 00:45:03,973 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 00:45:03,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-20 00:45:04,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-20 00:45:04,199 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:45:04,202 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 00:45:04,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:45:04 BoogieIcfgContainer [2022-03-20 00:45:04,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 00:45:04,311 INFO L158 Benchmark]: Toolchain (without parser) took 794062.55ms. Allocated memory was 178.3MB in the beginning and 677.4MB in the end (delta: 499.1MB). Free memory was 128.2MB in the beginning and 574.6MB in the end (delta: -446.4MB). Peak memory consumption was 53.0MB. Max. memory is 8.0GB. [2022-03-20 00:45:04,311 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 144.8MB in the end (delta: 75.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 00:45:04,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.44ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 128.0MB in the beginning and 196.6MB in the end (delta: -68.6MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-03-20 00:45:04,312 INFO L158 Benchmark]: Boogie Preprocessor took 25.64ms. Allocated memory is still 219.2MB. Free memory was 196.6MB in the beginning and 195.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 00:45:04,312 INFO L158 Benchmark]: RCFGBuilder took 315.02ms. Allocated memory is still 219.2MB. Free memory was 195.0MB in the beginning and 183.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 00:45:04,312 INFO L158 Benchmark]: TraceAbstraction took 793468.97ms. Allocated memory was 219.2MB in the beginning and 677.4MB in the end (delta: 458.2MB). Free memory was 182.9MB in the beginning and 574.6MB in the end (delta: -391.6MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-03-20 00:45:04,313 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 144.8MB in the end (delta: 75.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.44ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 128.0MB in the beginning and 196.6MB in the end (delta: -68.6MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.64ms. Allocated memory is still 219.2MB. Free memory was 196.6MB in the beginning and 195.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.02ms. Allocated memory is still 219.2MB. Free memory was 195.0MB in the beginning and 183.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 793468.97ms. Allocated memory was 219.2MB in the beginning and 677.4MB in the end (delta: 458.2MB). Free memory was 182.9MB in the beginning and 574.6MB in the end (delta: -391.6MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=24, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=34, y=55] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=34, y=55] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=55, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=55, c=34, counter=1, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=55, b=34, c=21, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=34, b=21, c=13, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=21, b=13, c=8, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=13, b=8, c=5, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=8, b=5, c=3, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=5, b=3, c=2, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=34, xy=1870, y=55, yy=3025] [L40] COND FALSE !(counter++<20) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 793.3s, OverallIterations: 25, TraceHistogramMax: 53, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 613.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 2444 SdHoareTripleChecker+Valid, 198.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2360 mSDsluCounter, 8101 SdHoareTripleChecker+Invalid, 197.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6703 mSDsCounter, 2218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6367 IncrementalHoareTripleChecker+Invalid, 8655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2218 mSolverCounterUnsat, 1398 mSDtfsCounter, 6367 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4075 GetRequests, 3596 SyntacticMatches, 21 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 452.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3129occurred in iteration=23, InterpolantAutomatonStates: 386, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 890 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 92.4s SatisfiabilityAnalysisTime, 73.6s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2443 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3846 ConstructedInterpolants, 0 QuantifiedInterpolants, 24745 SizeOfPredicates, 152 NumberOfNonLiveVariables, 5858 ConjunctsInSsa, 642 ConjunctsInUnsatCore, 41 InterpolantComputations, 7 PerfectInterpolantSequences, 11750/18950 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-20 00:45:04,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...