/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/hard-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 15:27:28,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 15:27:28,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 15:27:28,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 15:27:28,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 15:27:28,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 15:27:28,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 15:27:28,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 15:27:28,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 15:27:28,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 15:27:28,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 15:27:28,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 15:27:28,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 15:27:28,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 15:27:28,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 15:27:28,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 15:27:28,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 15:27:28,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 15:27:28,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 15:27:28,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 15:27:28,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 15:27:29,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 15:27:29,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 15:27:29,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 15:27:29,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 15:27:29,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 15:27:29,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 15:27:29,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 15:27:29,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 15:27:29,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 15:27:29,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 15:27:29,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 15:27:29,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 15:27:29,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 15:27:29,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 15:27:29,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 15:27:29,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 15:27:29,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 15:27:29,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 15:27:29,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 15:27:29,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 15:27:29,024 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 [2021-05-02 15:27:29,064 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 15:27:29,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 15:27:29,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 15:27:29,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 15:27:29,065 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 15:27:29,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 15:27:29,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 15:27:29,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 15:27:29,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 15:27:29,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 15:27:29,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 15:27:29,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 15:27:29,069 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; [2021-05-02 15:27:29,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 15:27:29,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 15:27:29,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 15:27:29,365 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 15:27:29,367 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 15:27:29,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c [2021-05-02 15:27:29,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f3a1b50/b9a4e9aaacba4437b898851e8d202c94/FLAG33782bf26 [2021-05-02 15:27:29,851 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 15:27:29,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c [2021-05-02 15:27:29,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f3a1b50/b9a4e9aaacba4437b898851e8d202c94/FLAG33782bf26 [2021-05-02 15:27:29,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f3a1b50/b9a4e9aaacba4437b898851e8d202c94 [2021-05-02 15:27:29,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 15:27:29,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 15:27:29,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 15:27:29,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 15:27:29,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 15:27:29,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 03:27:29" (1/1) ... [2021-05-02 15:27:29,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46895e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:29, skipping insertion in model container [2021-05-02 15:27:29,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 03:27:29" (1/1) ... [2021-05-02 15:27:29,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 15:27:29,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 15:27:30,051 WARN L224 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/hard-ll_valuebound1.c[546,559] [2021-05-02 15:27:30,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 15:27:30,085 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 15:27:30,099 WARN L224 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/hard-ll_valuebound1.c[546,559] [2021-05-02 15:27:30,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 15:27:30,128 INFO L208 MainTranslator]: Completed translation [2021-05-02 15:27:30,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30 WrapperNode [2021-05-02 15:27:30,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 15:27:30,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 15:27:30,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 15:27:30,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 15:27:30,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... [2021-05-02 15:27:30,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 15:27:30,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 15:27:30,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 15:27:30,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 15:27:30,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 15:27:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 15:27:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 15:27:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 15:27:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 15:27:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 15:27:30,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 15:27:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 15:27:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 15:27:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 15:27:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 15:27:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_unsigned_int [2021-05-02 15:27:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 15:27:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 15:27:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 15:27:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 15:27:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 15:27:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 15:27:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 15:27:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 15:27:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 15:27:30,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 15:27:30,535 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 15:27:30,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 03:27:30 BoogieIcfgContainer [2021-05-02 15:27:30,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 15:27:30,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 15:27:30,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 15:27:30,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 15:27:30,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 03:27:29" (1/3) ... [2021-05-02 15:27:30,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9853cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 03:27:30, skipping insertion in model container [2021-05-02 15:27:30,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 03:27:30" (2/3) ... [2021-05-02 15:27:30,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9853cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 03:27:30, skipping insertion in model container [2021-05-02 15:27:30,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 03:27:30" (3/3) ... [2021-05-02 15:27:30,543 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2021-05-02 15:27:30,548 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 15:27:30,551 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 15:27:30,565 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 15:27:30,582 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 15:27:30,582 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 15:27:30,582 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 15:27:30,582 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 15:27:30,582 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 15:27:30,582 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 15:27:30,582 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 15:27:30,582 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 15:27:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 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) [2021-05-02 15:27:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 15:27:30,599 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:30,599 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:27:30,600 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2021-05-02 15:27:30,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:30,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948127002] [2021-05-02 15:27:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:30,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 15:27:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:30,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 15:27:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:30,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 15:27:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:30,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 15:27:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 15:27:30,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:30,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948127002] [2021-05-02 15:27:30,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948127002] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:27:30,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:27:30,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 15:27:30,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517825442] [2021-05-02 15:27:30,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 15:27:30,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 15:27:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 15:27:30,886 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 15:27:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:31,004 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2021-05-02 15:27:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 15:27:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2021-05-02 15:27:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:31,012 INFO L225 Difference]: With dead ends: 69 [2021-05-02 15:27:31,012 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 15:27:31,015 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 15:27:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 15:27:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 15:27:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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) [2021-05-02 15:27:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-05-02 15:27:31,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2021-05-02 15:27:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:31,051 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-05-02 15:27:31,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 15:27:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-05-02 15:27:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 15:27:31,053 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:31,053 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:27:31,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 15:27:31,054 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2021-05-02 15:27:31,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:31,055 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635524540] [2021-05-02 15:27:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 15:27:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 15:27:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 15:27:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 15:27:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 15:27:31,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:31,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635524540] [2021-05-02 15:27:31,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635524540] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:27:31,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:27:31,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 15:27:31,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780406292] [2021-05-02 15:27:31,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 15:27:31,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 15:27:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 15:27:31,240 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-05-02 15:27:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:31,619 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-05-02 15:27:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 15:27:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2021-05-02 15:27:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:31,622 INFO L225 Difference]: With dead ends: 46 [2021-05-02 15:27:31,622 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 15:27:31,624 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 188.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 15:27:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 15:27:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2021-05-02 15:27:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-05-02 15:27:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2021-05-02 15:27:31,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2021-05-02 15:27:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:31,652 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-05-02 15:27:31,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-05-02 15:27:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2021-05-02 15:27:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 15:27:31,655 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:31,658 INFO L523 BasicCegarLoop]: trace histogram [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, 1] [2021-05-02 15:27:31,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 15:27:31,659 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2021-05-02 15:27:31,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:31,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457148455] [2021-05-02 15:27:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 15:27:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 15:27:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 15:27:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 15:27:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 15:27:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 15:27:31,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:31,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457148455] [2021-05-02 15:27:31,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457148455] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:27:31,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:27:31,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 15:27:31,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781280995] [2021-05-02 15:27:31,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 15:27:31,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 15:27:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 15:27:31,796 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-02 15:27:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:32,074 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2021-05-02 15:27:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 15:27:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2021-05-02 15:27:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:32,075 INFO L225 Difference]: With dead ends: 50 [2021-05-02 15:27:32,075 INFO L226 Difference]: Without dead ends: 48 [2021-05-02 15:27:32,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 142.4ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 15:27:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-02 15:27:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2021-05-02 15:27:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 15:27:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-05-02 15:27:32,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2021-05-02 15:27:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:32,084 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-05-02 15:27:32,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-02 15:27:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-05-02 15:27:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 15:27:32,085 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:32,086 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-05-02 15:27:32,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 15:27:32,086 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2021-05-02 15:27:32,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:32,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407249444] [2021-05-02 15:27:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:32,098 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:32,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43835701] [2021-05-02 15:27:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:32,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2021-05-02 15:27:32,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:32,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-02 15:27:32,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:32,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407249444] [2021-05-02 15:27:32,517 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:32,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43835701] [2021-05-02 15:27:32,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43835701] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:32,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:32,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-05-02 15:27:32,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893704941] [2021-05-02 15:27:32,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 15:27:32,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:32,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 15:27:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-05-02 15:27:32,518 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 15:27:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:32,756 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2021-05-02 15:27:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 15:27:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2021-05-02 15:27:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:32,759 INFO L225 Difference]: With dead ends: 73 [2021-05-02 15:27:32,759 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 15:27:32,761 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 128.6ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-05-02 15:27:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 15:27:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 15:27:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 15:27:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2021-05-02 15:27:32,788 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 38 [2021-05-02 15:27:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:32,789 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2021-05-02 15:27:32,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 15:27:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2021-05-02 15:27:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 15:27:32,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:32,790 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2021-05-02 15:27:32,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:32,993 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2021-05-02 15:27:32,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:32,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184155329] [2021-05-02 15:27:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:33,014 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:33,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597152414] [2021-05-02 15:27:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:33,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-02 15:27:33,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:33,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-05-02 15:27:33,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:33,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184155329] [2021-05-02 15:27:33,435 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:33,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597152414] [2021-05-02 15:27:33,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597152414] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 15:27:33,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 15:27:33,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 15:27:33,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822150486] [2021-05-02 15:27:33,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 15:27:33,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:33,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 15:27:33,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-05-02 15:27:33,437 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-02 15:27:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:33,606 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2021-05-02 15:27:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 15:27:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2021-05-02 15:27:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:33,610 INFO L225 Difference]: With dead ends: 69 [2021-05-02 15:27:33,610 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 15:27:33,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-05-02 15:27:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 15:27:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-02 15:27:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 15:27:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-05-02 15:27:33,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 45 [2021-05-02 15:27:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:33,626 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-05-02 15:27:33,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-02 15:27:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-05-02 15:27:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 15:27:33,630 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:33,631 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:27:33,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:33,848 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2021-05-02 15:27:33,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:33,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849777468] [2021-05-02 15:27:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:33,857 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:33,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070323158] [2021-05-02 15:27:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:33,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 33 conjunts are in the unsatisfiable core [2021-05-02 15:27:33,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:33,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:33,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-05-02 15:27:34,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:34,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849777468] [2021-05-02 15:27:34,178 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:34,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070323158] [2021-05-02 15:27:34,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070323158] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:34,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:34,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-05-02 15:27:34,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737457545] [2021-05-02 15:27:34,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 15:27:34,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 15:27:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-02 15:27:34,180 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-05-02 15:27:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:34,450 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2021-05-02 15:27:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 15:27:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2021-05-02 15:27:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:34,452 INFO L225 Difference]: With dead ends: 95 [2021-05-02 15:27:34,452 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 15:27:34,453 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-05-02 15:27:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 15:27:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 15:27:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-02 15:27:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2021-05-02 15:27:34,464 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 55 [2021-05-02 15:27:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:34,464 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2021-05-02 15:27:34,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-05-02 15:27:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2021-05-02 15:27:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 15:27:34,465 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:34,465 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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] [2021-05-02 15:27:34,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:34,683 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1784683007, now seen corresponding path program 1 times [2021-05-02 15:27:34,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:34,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418592893] [2021-05-02 15:27:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:34,689 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:34,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231433430] [2021-05-02 15:27:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:34,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2021-05-02 15:27:34,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:34,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,832 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:34,980 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-05-02 15:27:35,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:35,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418592893] [2021-05-02 15:27:35,135 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:35,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231433430] [2021-05-02 15:27:35,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231433430] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:35,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:35,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-05-02 15:27:35,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882515999] [2021-05-02 15:27:35,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 15:27:35,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 15:27:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-02 15:27:35,136 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-05-02 15:27:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:35,441 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2021-05-02 15:27:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 15:27:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 62 [2021-05-02 15:27:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:35,443 INFO L225 Difference]: With dead ends: 99 [2021-05-02 15:27:35,443 INFO L226 Difference]: Without dead ends: 84 [2021-05-02 15:27:35,444 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-05-02 15:27:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-05-02 15:27:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-05-02 15:27:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 15:27:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-05-02 15:27:35,454 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 62 [2021-05-02 15:27:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-05-02 15:27:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-05-02 15:27:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-05-02 15:27:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-02 15:27:35,455 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:35,455 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 15:27:35,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:35,678 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1254068366, now seen corresponding path program 2 times [2021-05-02 15:27:35,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:35,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375690295] [2021-05-02 15:27:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:35,686 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:35,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105762214] [2021-05-02 15:27:35,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:35,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 15:27:35,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 15:27:35,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-02 15:27:35,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:35,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:35,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-05-02 15:27:36,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:36,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375690295] [2021-05-02 15:27:36,031 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:36,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105762214] [2021-05-02 15:27:36,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105762214] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:36,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:36,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-05-02 15:27:36,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099529745] [2021-05-02 15:27:36,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 15:27:36,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 15:27:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 15:27:36,033 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2021-05-02 15:27:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:36,162 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2021-05-02 15:27:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 15:27:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 72 [2021-05-02 15:27:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:36,163 INFO L225 Difference]: With dead ends: 103 [2021-05-02 15:27:36,163 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 15:27:36,164 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-05-02 15:27:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 15:27:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-05-02 15:27:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 states have internal predecessors, (46), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 15:27:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2021-05-02 15:27:36,173 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 72 [2021-05-02 15:27:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:36,173 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2021-05-02 15:27:36,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2021-05-02 15:27:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2021-05-02 15:27:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 15:27:36,174 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:36,174 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 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] [2021-05-02 15:27:36,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:36,394 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 680531353, now seen corresponding path program 1 times [2021-05-02 15:27:36,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:36,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896453262] [2021-05-02 15:27:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:36,402 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:36,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307897101] [2021-05-02 15:27:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 15:27:36,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjunts are in the unsatisfiable core [2021-05-02 15:27:36,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:36,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:36,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-05-02 15:27:37,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:37,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896453262] [2021-05-02 15:27:37,075 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:37,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307897101] [2021-05-02 15:27:37,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307897101] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:37,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:37,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-05-02 15:27:37,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733969908] [2021-05-02 15:27:37,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 15:27:37,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:37,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 15:27:37,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-05-02 15:27:37,078 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2021-05-02 15:27:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:37,370 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2021-05-02 15:27:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 15:27:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2021-05-02 15:27:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:37,373 INFO L225 Difference]: With dead ends: 84 [2021-05-02 15:27:37,373 INFO L226 Difference]: Without dead ends: 82 [2021-05-02 15:27:37,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 281.3ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-05-02 15:27:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-02 15:27:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2021-05-02 15:27:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-02 15:27:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2021-05-02 15:27:37,390 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 75 [2021-05-02 15:27:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:37,390 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2021-05-02 15:27:37,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2021-05-02 15:27:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2021-05-02 15:27:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 15:27:37,392 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 15:27:37,392 INFO L523 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 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] [2021-05-02 15:27:37,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:37,616 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 15:27:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 15:27:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1566820819, now seen corresponding path program 2 times [2021-05-02 15:27:37,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 15:27:37,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489030881] [2021-05-02 15:27:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 15:27:37,624 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 15:27:37,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832994099] [2021-05-02 15:27:37,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 15:27:37,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 15:27:37,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 15:27:37,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2021-05-02 15:27:37,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 15:27:37,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,943 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:37,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,241 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 15:27:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-05-02 15:27:38,276 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 15:27:38,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489030881] [2021-05-02 15:27:38,276 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 15:27:38,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832994099] [2021-05-02 15:27:38,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832994099] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 15:27:38,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 15:27:38,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-05-02 15:27:38,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815953573] [2021-05-02 15:27:38,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 15:27:38,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 15:27:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 15:27:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-05-02 15:27:38,279 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-02 15:27:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 15:27:38,511 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2021-05-02 15:27:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 15:27:38,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 80 [2021-05-02 15:27:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 15:27:38,512 INFO L225 Difference]: With dead ends: 94 [2021-05-02 15:27:38,512 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 15:27:38,515 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 288.7ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-02 15:27:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 15:27:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 15:27:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 15:27:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 15:27:38,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2021-05-02 15:27:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 15:27:38,516 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 15:27:38,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-02 15:27:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 15:27:38,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 15:27:38,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 15:27:38,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 15:27:39,032 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2021-05-02 15:27:39,154 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2021-05-02 15:27:39,332 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2021-05-02 15:27:39,470 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2021-05-02 15:27:39,638 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2021-05-02 15:27:39,780 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2021-05-02 15:27:39,922 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 15:27:40,037 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2021-05-02 15:27:40,037 INFO L198 CegarLoopUtils]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point L29(line 29) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (let ((.cse1 (mod main_~B~0 4294967296))) (let ((.cse0 (= main_~d~0 .cse1)) (.cse2 (= main_~p~0 1))) (or (and (= main_~q~0 0) .cse0 (<= .cse1 1) (<= 1 .cse1) .cse2) (let ((.cse3 (mod main_~A~0 4294967296)) (.cse4 (+ main_~r~0 main_~d~0))) (and .cse0 (< .cse3 (* 2 .cse1)) (= main_~q~0 main_~p~0) (<= .cse3 1) .cse2 (= .cse4 .cse3) (<= .cse1 .cse4)))))) [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 22 63) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point L54(lines 54 57) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point L54-2(lines 22 63) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point L48(lines 46 58) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L194 CegarLoopUtils]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse2 (mod main_~B~0 4294967296))) (let ((.cse1 (mod main_~A~0 4294967296)) (.cse0 (= main_~d~0 .cse2)) (.cse3 (= main_~p~0 1))) (or (let ((.cse4 (+ main_~r~0 main_~d~0))) (and .cse0 (< .cse1 (* 2 .cse2)) (= main_~q~0 main_~p~0) (<= .cse1 1) .cse3 (= .cse4 .cse1) (<= .cse2 .cse4))) (and (= main_~q~0 0) (= main_~r~0 .cse1) .cse0 (<= .cse2 1) (< main_~r~0 .cse2) .cse3)))) [2021-05-02 15:27:40,038 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 22 63) no Hoare annotation was computed. [2021-05-02 15:27:40,038 INFO L194 CegarLoopUtils]: At program point L38(line 38) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse0 (= main_~q~0 0)) (.cse2 (= main_~r~0 .cse4)) (.cse3 (<= .cse4 1)) (.cse1 (mod main_~B~0 4294967296))) (or (and .cse0 (= main_~d~0 (* .cse1 2)) .cse2 (= main_~p~0 2) (<= .cse1 main_~r~0) (< 0 (+ (div (div (+ main_~d~0 (- 2)) 2) 4294967296) 1)) .cse3) (and .cse0 .cse2 (<= .cse1 1) (< 0 (+ (div (+ main_~d~0 (- 1)) 4294967296) 1)) .cse3 (= main_~p~0 1) (<= main_~d~0 .cse1))))) [2021-05-02 15:27:40,039 INFO L194 CegarLoopUtils]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse0 (= main_~q~0 0)) (.cse2 (= main_~r~0 .cse4)) (.cse3 (<= .cse4 1)) (.cse1 (mod main_~B~0 4294967296))) (or (and .cse0 (= main_~d~0 (* .cse1 2)) .cse2 (= main_~p~0 2) (<= .cse1 main_~r~0) (< 0 (+ (div (div (+ main_~d~0 (- 2)) 2) 4294967296) 1)) .cse3) (and .cse0 .cse2 (<= .cse1 1) (< 0 (+ (div (+ main_~d~0 (- 1)) 4294967296) 1)) .cse3 (= main_~p~0 1) (<= main_~d~0 .cse1))))) [2021-05-02 15:27:40,039 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 22 63) the Hoare annotation is: true [2021-05-02 15:27:40,039 INFO L198 CegarLoopUtils]: For program point L61(line 61) no Hoare annotation was computed. [2021-05-02 15:27:40,039 INFO L194 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (<= (mod main_~A~0 4294967296) 1) [2021-05-02 15:27:40,039 INFO L194 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (mod main_~B~0 4294967296) 1) (<= (mod main_~A~0 4294967296) 1)) [2021-05-02 15:27:40,039 INFO L201 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-05-02 15:27:40,039 INFO L198 CegarLoopUtils]: For program point L26-1(line 26) no Hoare annotation was computed. [2021-05-02 15:27:40,039 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse3 (= main_~p~0 1)) (.cse5 (= main_~q~0 0)) (.cse6 (= main_~r~0 .cse4)) (.cse1 (mod main_~B~0 4294967296)) (.cse2 (<= .cse4 1))) (or (let ((.cse0 (+ main_~r~0 main_~d~0))) (and (= main_~q~0 main_~p~0) (< .cse0 (* 2 .cse1)) .cse2 .cse3 (= (+ main_~r~0 .cse1) .cse4) (= .cse0 .cse4) (<= .cse1 .cse0))) (and .cse5 .cse6 (= main_~d~0 .cse1) (<= .cse1 1) (< main_~r~0 .cse1) .cse3) (and .cse5 (= main_~d~0 (* .cse1 2)) .cse6 (= main_~p~0 2) (<= .cse1 main_~r~0) .cse2 (< main_~r~0 main_~d~0))))) [2021-05-02 15:27:40,039 INFO L194 CegarLoopUtils]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse3 (= main_~p~0 1)) (.cse5 (= main_~q~0 0)) (.cse6 (= main_~r~0 .cse4)) (.cse1 (mod main_~B~0 4294967296)) (.cse2 (<= .cse4 1))) (or (let ((.cse0 (+ main_~r~0 main_~d~0))) (and (= main_~q~0 main_~p~0) (< .cse0 (* 2 .cse1)) .cse2 .cse3 (= (+ main_~r~0 .cse1) .cse4) (= .cse0 .cse4) (<= .cse1 .cse0))) (and .cse5 .cse6 (= main_~d~0 .cse1) (<= .cse1 1) (< main_~r~0 .cse1) .cse3) (and .cse5 (= main_~d~0 (* .cse1 2)) .cse6 (= main_~p~0 2) (<= .cse1 main_~r~0) .cse2 (< main_~r~0 main_~d~0))))) [2021-05-02 15:27:40,039 INFO L198 CegarLoopUtils]: For program point L39(lines 36 44) no Hoare annotation was computed. [2021-05-02 15:27:40,040 INFO L194 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse0 (= main_~q~0 0)) (.cse2 (= main_~r~0 .cse4)) (.cse3 (<= .cse4 1)) (.cse1 (mod main_~B~0 4294967296))) (or (and .cse0 (= main_~d~0 (* .cse1 2)) .cse2 (= main_~p~0 2) (<= .cse1 main_~r~0) (< 0 (+ (div (div (+ main_~d~0 (- 2)) 2) 4294967296) 1)) .cse3) (and .cse0 .cse2 (<= .cse1 1) (< 0 (+ (div (+ main_~d~0 (- 1)) 4294967296) 1)) .cse3 (= main_~p~0 1) (<= main_~d~0 .cse1))))) [2021-05-02 15:27:40,040 INFO L194 CegarLoopUtils]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse4 (mod main_~A~0 4294967296))) (let ((.cse0 (= main_~q~0 0)) (.cse2 (= main_~r~0 .cse4)) (.cse3 (<= .cse4 1)) (.cse1 (mod main_~B~0 4294967296))) (or (and .cse0 (= main_~d~0 (* .cse1 2)) .cse2 (= main_~p~0 2) (<= .cse1 main_~r~0) (< 0 (+ (div (div (+ main_~d~0 (- 2)) 2) 4294967296) 1)) .cse3) (and .cse0 .cse2 (<= .cse1 1) (< 0 (+ (div (+ main_~d~0 (- 1)) 4294967296) 1)) .cse3 (= main_~p~0 1) (<= main_~d~0 .cse1))))) [2021-05-02 15:27:40,040 INFO L198 CegarLoopUtils]: For program point L16(lines 16 17) no Hoare annotation was computed. [2021-05-02 15:27:40,040 INFO L198 CegarLoopUtils]: For program point L15(lines 15 18) no Hoare annotation was computed. [2021-05-02 15:27:40,040 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2021-05-02 15:27:40,040 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2021-05-02 15:27:40,040 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2021-05-02 15:27:40,040 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-05-02 15:27:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 03:27:40 BoogieIcfgContainer [2021-05-02 15:27:40,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 15:27:40,056 INFO L168 Benchmark]: Toolchain (without parser) took 10177.94 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 218.9 MB in the beginning and 262.8 MB in the end (delta: -43.8 MB). Peak memory consumption was 198.0 MB. Max. memory is 8.0 GB. [2021-05-02 15:27:40,057 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 235.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 15:27:40,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.51 ms. Allocated memory is still 255.9 MB. Free memory was 218.8 MB in the beginning and 208.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 15:27:40,057 INFO L168 Benchmark]: Boogie Preprocessor took 59.09 ms. Allocated memory is still 255.9 MB. Free memory was 208.8 MB in the beginning and 237.6 MB in the end (delta: -28.8 MB). Peak memory consumption was 2.4 MB. Max. memory is 8.0 GB. [2021-05-02 15:27:40,057 INFO L168 Benchmark]: RCFGBuilder took 346.65 ms. Allocated memory is still 255.9 MB. Free memory was 237.1 MB in the beginning and 220.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-02 15:27:40,057 INFO L168 Benchmark]: TraceAbstraction took 9518.13 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 219.8 MB in the beginning and 262.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 199.8 MB. Max. memory is 8.0 GB. [2021-05-02 15:27:40,058 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 235.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 248.51 ms. Allocated memory is still 255.9 MB. Free memory was 218.8 MB in the beginning and 208.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.09 ms. Allocated memory is still 255.9 MB. Free memory was 208.8 MB in the beginning and 237.6 MB in the end (delta: -28.8 MB). Peak memory consumption was 2.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 346.65 ms. Allocated memory is still 255.9 MB. Free memory was 237.1 MB in the beginning and 220.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9518.13 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 219.8 MB in the beginning and 262.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 199.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8159.9ms, OverallIterations: 10, TraceHistogramMax: 10, EmptinessCheckTime: 18.5ms, AutomataDifference: 2472.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1296.5ms, InitialAbstractionConstructionTime: 9.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 338 SDtfs, 316 SDslu, 1411 SDs, 0 SdLazy, 1677 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1332.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1597.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 146.1ms AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 17 LocationsWithAnnotation, 68 PreInvPairs, 88 NumberOfFragments, 700 HoareAnnotationTreeSize, 68 FomulaSimplifications, 3600 FormulaSimplificationTreeSizeReduction, 136.5ms HoareSimplificationTime, 17 FomulaSimplificationsInter, 1498 FormulaSimplificationTreeSizeReductionInter, 1150.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 81.3ms SsaConstructionTime, 240.4ms SatisfiabilityAnalysisTime, 3281.0ms InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 2991 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 659/725 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((q == 0 && d == B % 4294967296 * 2) && r == A % 4294967296) && p == 2) && B % 4294967296 <= r) && 0 < (d + -2) / 2 / 4294967296 + 1) && A % 4294967296 <= 1) || ((((((q == 0 && r == A % 4294967296) && B % 4294967296 <= 1) && 0 < (d + -1) / 4294967296 + 1) && A % 4294967296 <= 1) && p == 1) && d <= B % 4294967296) RESULT: Ultimate proved your program to be correct! Received shutdown request...