/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/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 14:13:57,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 14:13:57,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 14:13:57,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 14:13:57,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 14:13:57,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 14:13:57,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 14:13:57,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 14:13:57,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 14:13:57,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 14:13:57,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 14:13:57,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 14:13:57,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 14:13:57,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 14:13:57,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 14:13:57,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 14:13:57,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 14:13:57,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 14:13:57,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 14:13:57,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 14:13:57,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 14:13:57,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 14:13:57,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 14:13:57,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 14:13:57,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 14:13:57,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 14:13:57,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 14:13:57,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 14:13:57,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 14:13:57,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 14:13:57,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 14:13:57,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 14:13:57,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 14:13:57,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 14:13:57,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 14:13:57,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 14:13:57,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 14:13:57,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 14:13:57,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 14:13:57,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 14:13:57,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 14:13:57,178 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 14:13:57,216 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 14:13:57,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 14:13:57,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 14:13:57,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 14:13:57,220 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 14:13:57,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 14:13:57,221 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 14:13:57,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 14:13:57,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 14:13:57,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 14:13:57,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 14:13:57,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 14:13:57,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 14:13:57,223 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 14:13:57,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 14:13:57,223 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 14:13:57,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 14:13:57,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 14:13:57,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 14:13:57,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 14:13:57,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 14:13:57,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 14:13:57,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 14:13:57,226 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 14:13:57,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 14:13:57,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 14:13:57,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 14:13:57,605 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 14:13:57,605 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 14:13:57,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2021-05-02 14:13:57,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8111947b/3d9eaaa612b046ccb0621dd6587d407d/FLAGe62a69acf [2021-05-02 14:13:58,107 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 14:13:58,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2021-05-02 14:13:58,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8111947b/3d9eaaa612b046ccb0621dd6587d407d/FLAGe62a69acf [2021-05-02 14:13:58,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8111947b/3d9eaaa612b046ccb0621dd6587d407d [2021-05-02 14:13:58,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 14:13:58,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 14:13:58,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 14:13:58,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 14:13:58,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 14:13:58,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba3c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58, skipping insertion in model container [2021-05-02 14:13:58,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 14:13:58,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 14:13:58,318 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/dijkstra-u_unwindbound2.c[533,546] [2021-05-02 14:13:58,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 14:13:58,388 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 14:13:58,424 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/dijkstra-u_unwindbound2.c[533,546] [2021-05-02 14:13:58,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 14:13:58,454 INFO L208 MainTranslator]: Completed translation [2021-05-02 14:13:58,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58 WrapperNode [2021-05-02 14:13:58,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 14:13:58,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 14:13:58,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 14:13:58,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 14:13:58,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (1/1) ... [2021-05-02 14:13:58,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 14:13:58,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 14:13:58,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 14:13:58,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 14:13:58,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (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 14:13:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 14:13:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 14:13:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 14:13:58,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 14:13:58,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 14:13:58,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 14:13:58,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 14:13:58,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 14:13:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 14:13:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 14:13:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_unsigned_int [2021-05-02 14:13:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 14:13:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 14:13:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 14:13:58,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 14:13:58,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 14:13:58,872 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 14:13:58,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 02:13:58 BoogieIcfgContainer [2021-05-02 14:13:58,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 14:13:58,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 14:13:58,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 14:13:58,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 14:13:58,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 02:13:58" (1/3) ... [2021-05-02 14:13:58,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb87b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 02:13:58, skipping insertion in model container [2021-05-02 14:13:58,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 02:13:58" (2/3) ... [2021-05-02 14:13:58,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb87b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 02:13:58, skipping insertion in model container [2021-05-02 14:13:58,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 02:13:58" (3/3) ... [2021-05-02 14:13:58,879 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2021-05-02 14:13:58,884 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 14:13:58,887 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 14:13:58,901 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 14:13:58,919 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 14:13:58,919 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 14:13:58,919 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 14:13:58,919 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 14:13:58,919 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 14:13:58,919 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 14:13:58,919 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 14:13:58,920 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 14:13:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 14:13:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 14:13:58,937 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:13:58,938 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 14:13:58,938 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:13:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:13:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2021-05-02 14:13:58,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:13:58,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331673817] [2021-05-02 14:13:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:13:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:13:59,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 14:13:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:13:59,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 14:13:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:13:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:13:59,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:13:59,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331673817] [2021-05-02 14:13:59,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331673817] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:13:59,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:13:59,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 14:13:59,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369445175] [2021-05-02 14:13:59,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 14:13:59,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:13:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 14:13:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 14:13:59,235 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:02,120 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2021-05-02 14:14:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 14:14:02,122 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-05-02 14:14:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:02,128 INFO L225 Difference]: With dead ends: 70 [2021-05-02 14:14:02,128 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 14:14:02,131 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 14:14:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 14:14:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-02 14:14:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 14:14:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2021-05-02 14:14:02,167 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2021-05-02 14:14:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:02,168 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2021-05-02 14:14:02,168 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2021-05-02 14:14:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 14:14:02,169 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:02,169 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 14:14:02,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 14:14:02,169 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2021-05-02 14:14:02,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:02,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729877849] [2021-05-02 14:14:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:02,190 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 14:14:02,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386775397] [2021-05-02 14:14:02,191 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 14:14:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:02,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 14:14:02,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:02,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:02,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:02,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729877849] [2021-05-02 14:14:02,412 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 14:14:02,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386775397] [2021-05-02 14:14:02,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386775397] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:02,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:14:02,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 14:14:02,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079676224] [2021-05-02 14:14:02,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 14:14:02,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:02,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 14:14:02,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 14:14:02,415 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:02,436 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2021-05-02 14:14:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 14:14:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 14:14:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:02,438 INFO L225 Difference]: With dead ends: 55 [2021-05-02 14:14:02,438 INFO L226 Difference]: Without dead ends: 36 [2021-05-02 14:14:02,439 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 14:14:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-05-02 14:14:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-05-02 14:14:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 14:14:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2021-05-02 14:14:02,447 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2021-05-02 14:14:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:02,447 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2021-05-02 14:14:02,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2021-05-02 14:14:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 14:14:02,448 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:02,448 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 14:14:02,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-05-02 14:14:02,675 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2021-05-02 14:14:02,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:02,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700150813] [2021-05-02 14:14:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:02,691 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 14:14:02,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449422140] [2021-05-02 14:14:02,692 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 14:14:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:02,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 14:14:02,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:02,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:02,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:02,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700150813] [2021-05-02 14:14:02,904 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 14:14:02,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449422140] [2021-05-02 14:14:02,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449422140] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:02,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:14:02,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 14:14:02,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590589616] [2021-05-02 14:14:02,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 14:14:02,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 14:14:02,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 14:14:02,906 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:02,943 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-05-02 14:14:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 14:14:02,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-02 14:14:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:02,944 INFO L225 Difference]: With dead ends: 49 [2021-05-02 14:14:02,945 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 14:14:02,945 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 14:14:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 14:14:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-05-02 14:14:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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 14:14:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2021-05-02 14:14:02,970 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2021-05-02 14:14:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:02,971 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2021-05-02 14:14:02,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2021-05-02 14:14:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 14:14:02,971 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:02,972 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 14:14:03,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 14:14:03,177 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2021-05-02 14:14:03,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:03,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119509884] [2021-05-02 14:14:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:03,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 14:14:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:03,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 14:14:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:03,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:03,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119509884] [2021-05-02 14:14:03,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119509884] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:03,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:14:03,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 14:14:03,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435894138] [2021-05-02 14:14:03,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 14:14:03,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 14:14:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 14:14:03,585 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:19,041 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2021-05-02 14:14:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 14:14:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-02 14:14:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:19,073 INFO L225 Difference]: With dead ends: 72 [2021-05-02 14:14:19,073 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 14:14:19,074 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 360.7ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 14:14:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 14:14:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2021-05-02 14:14:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 14:14:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2021-05-02 14:14:19,095 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 21 [2021-05-02 14:14:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:19,096 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2021-05-02 14:14:19,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2021-05-02 14:14:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 14:14:19,097 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:19,097 INFO L523 BasicCegarLoop]: trace histogram [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 14:14:19,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 14:14:19,097 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2021-05-02 14:14:19,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:19,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181763193] [2021-05-02 14:14:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:19,120 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 14:14:19,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896217839] [2021-05-02 14:14:19,121 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 14:14:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:19,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 14:14:19,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:19,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:19,263 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:19,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181763193] [2021-05-02 14:14:19,264 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 14:14:19,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896217839] [2021-05-02 14:14:19,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896217839] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 14:14:19,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-05-02 14:14:19,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-05-02 14:14:19,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84140861] [2021-05-02 14:14:19,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 14:14:19,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 14:14:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 14:14:19,265 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:19,332 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2021-05-02 14:14:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 14:14:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2021-05-02 14:14:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:19,335 INFO L225 Difference]: With dead ends: 71 [2021-05-02 14:14:19,335 INFO L226 Difference]: Without dead ends: 52 [2021-05-02 14:14:19,336 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 14:14:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-05-02 14:14:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-05-02 14:14:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 14:14:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2021-05-02 14:14:19,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 23 [2021-05-02 14:14:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:19,357 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2021-05-02 14:14:19,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2021-05-02 14:14:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 14:14:19,358 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:19,358 INFO L523 BasicCegarLoop]: trace histogram [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 14:14:19,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 14:14:19,586 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2021-05-02 14:14:19,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:19,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547314671] [2021-05-02 14:14:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:19,595 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 14:14:19,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867078100] [2021-05-02 14:14:19,595 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 14:14:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:19,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 14:14:19,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:19,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-05-02 14:14:19,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:19,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547314671] [2021-05-02 14:14:19,924 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 14:14:19,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867078100] [2021-05-02 14:14:19,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867078100] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:19,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:14:19,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 14:14:19,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995634606] [2021-05-02 14:14:19,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 14:14:19,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 14:14:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 14:14:19,926 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:37,495 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2021-05-02 14:14:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 14:14:37,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-02 14:14:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:37,497 INFO L225 Difference]: With dead ends: 70 [2021-05-02 14:14:37,497 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 14:14:37,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-05-02 14:14:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 14:14:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 14:14:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 14:14:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2021-05-02 14:14:37,512 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 24 [2021-05-02 14:14:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:37,512 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2021-05-02 14:14:37,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 14:14:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2021-05-02 14:14:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 14:14:37,513 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:37,513 INFO L523 BasicCegarLoop]: trace histogram [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 14:14:37,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 14:14:37,716 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2021-05-02 14:14:37,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:37,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460392658] [2021-05-02 14:14:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:37,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 14:14:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:37,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 14:14:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:37,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:37,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460392658] [2021-05-02 14:14:37,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460392658] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 14:14:37,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490038260] [2021-05-02 14:14:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 14:14:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:37,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 14:14:37,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:37,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:37,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490038260] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:37,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 14:14:37,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2021-05-02 14:14:37,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917573334] [2021-05-02 14:14:37,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 14:14:37,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 14:14:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 14:14:37,948 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:38,021 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2021-05-02 14:14:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 14:14:38,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-05-02 14:14:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:38,023 INFO L225 Difference]: With dead ends: 79 [2021-05-02 14:14:38,023 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 14:14:38,024 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.0ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-05-02 14:14:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 14:14:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 14:14:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 14:14:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2021-05-02 14:14:38,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2021-05-02 14:14:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:38,030 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2021-05-02 14:14:38,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 14:14:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2021-05-02 14:14:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 14:14:38,031 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 14:14:38,031 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 14:14:38,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-02 14:14:38,249 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 14:14:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 14:14:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1629545878, now seen corresponding path program 1 times [2021-05-02 14:14:38,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 14:14:38,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742370586] [2021-05-02 14:14:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 14:14:38,257 ERROR L278 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-05-02 14:14:38,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387850766] [2021-05-02 14:14:38,257 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 14:14:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 14:14:38,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 14:14:38,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 14:14:38,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:38,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:38,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:38,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 14:14:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 14:14:38,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 14:14:38,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742370586] [2021-05-02 14:14:38,440 WARN L340 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-05-02 14:14:38,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387850766] [2021-05-02 14:14:38,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387850766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 14:14:38,441 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 14:14:38,441 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 14:14:38,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239568920] [2021-05-02 14:14:38,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 14:14:38,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 14:14:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 14:14:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 14:14:38,444 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 14:14:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 14:14:38,845 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2021-05-02 14:14:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 14:14:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-05-02 14:14:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 14:14:38,846 INFO L225 Difference]: With dead ends: 51 [2021-05-02 14:14:38,846 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 14:14:38,847 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-05-02 14:14:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 14:14:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 14:14:38,847 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 14:14:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 14:14:38,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-05-02 14:14:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 14:14:38,847 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 14:14:38,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 14:14:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 14:14:38,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 14:14:39,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 14:14:39,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 14:14:39,382 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2021-05-02 14:14:39,652 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-05-02 14:14:39,652 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-05-02 14:14:39,652 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 14:14:39,653 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)|) (= ~counter~0 |old(~counter~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L194 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~counter~0 0) (<= 0 ~counter~0)) [2021-05-02 14:14:39,653 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L9(line 9) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L31(lines 31 32) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 20 61) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L52(lines 52 55) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2021-05-02 14:14:39,653 INFO L198 CegarLoopUtils]: For program point L44(lines 38 56) no Hoare annotation was computed. [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (< (mod main_~n~0 4294967296) 1073741823) (= main_~h~0 0) (= main_~p~0 0) (<= 2 ~counter~0))) [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (= ~counter~0 |old(~counter~0)|)) [2021-05-02 14:14:39,654 INFO L198 CegarLoopUtils]: For program point L24-1(line 24) no Hoare annotation was computed. [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (< (mod main_~n~0 4294967296) 1073741823) (= main_~h~0 0) (= main_~p~0 0)) (not (<= 0 |old(~counter~0)|))) [2021-05-02 14:14:39,654 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 20 61) no Hoare annotation was computed. [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,654 INFO L198 CegarLoopUtils]: For program point L38(lines 38 56) no Hoare annotation was computed. [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L38-2(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (< (mod main_~n~0 4294967296) 1073741823) (= main_~h~0 0) (= main_~p~0 0) (<= 2 ~counter~0))) [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (= ~counter~0 |old(~counter~0)|)) [2021-05-02 14:14:39,654 INFO L198 CegarLoopUtils]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2021-05-02 14:14:39,654 INFO L194 CegarLoopUtils]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= main_~n~0 main_~r~0)) (.cse1 (< (mod main_~n~0 4294967296) 1073741823)) (.cse2 (= main_~h~0 0)) (.cse3 (= main_~p~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 (<= 1 ~counter~0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= main_~q~0 1) (<= 0 ~counter~0)) (not (<= 0 |old(~counter~0)|)))) [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-05-02 14:14:39,655 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,655 INFO L194 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,655 INFO L194 CegarLoopUtils]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)) (and (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~p~0 0) (<= (+ (* 4294967296 (div (+ (* main_~p~0 2) main_~q~0) 4294967296)) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* 4294967296 (div main_~r~0 4294967296)))) (= main_~q~0 1) (<= 2 ~counter~0))) [2021-05-02 14:14:39,655 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point L13(lines 13 14) no Hoare annotation was computed. [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point L12(lines 12 15) no Hoare annotation was computed. [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2021-05-02 14:14:39,655 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-05-02 14:14:39,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 02:14:39 BoogieIcfgContainer [2021-05-02 14:14:39,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 14:14:39,668 INFO L168 Benchmark]: Toolchain (without parser) took 41529.56 ms. Allocated memory was 198.2 MB in the beginning and 242.2 MB in the end (delta: 44.0 MB). Free memory was 161.9 MB in the beginning and 118.8 MB in the end (delta: 43.1 MB). Peak memory consumption was 88.0 MB. Max. memory is 8.0 GB. [2021-05-02 14:14:39,668 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 198.2 MB. Free memory is still 178.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 14:14:39,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.29 ms. Allocated memory is still 198.2 MB. Free memory was 161.7 MB in the beginning and 178.9 MB in the end (delta: -17.3 MB). Peak memory consumption was 11.6 MB. Max. memory is 8.0 GB. [2021-05-02 14:14:39,668 INFO L168 Benchmark]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 198.2 MB. Free memory was 178.9 MB in the beginning and 177.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 14:14:39,669 INFO L168 Benchmark]: RCFGBuilder took 366.32 ms. Allocated memory is still 198.2 MB. Free memory was 177.3 MB in the beginning and 159.5 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-02 14:14:39,669 INFO L168 Benchmark]: TraceAbstraction took 40793.27 ms. Allocated memory was 198.2 MB in the beginning and 242.2 MB in the end (delta: 44.0 MB). Free memory was 159.0 MB in the beginning and 118.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 8.0 GB. [2021-05-02 14:14:39,669 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.16 ms. Allocated memory is still 198.2 MB. Free memory is still 178.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 315.29 ms. Allocated memory is still 198.2 MB. Free memory was 161.7 MB in the beginning and 178.9 MB in the end (delta: -17.3 MB). Peak memory consumption was 11.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 198.2 MB. Free memory was 178.9 MB in the beginning and 177.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 366.32 ms. Allocated memory is still 198.2 MB. Free memory was 177.3 MB in the beginning and 159.5 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 40793.27 ms. Allocated memory was 198.2 MB in the beginning and 242.2 MB in the end (delta: 44.0 MB). Free memory was 159.0 MB in the beginning and 118.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 40132.3ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 11.8ms, AutomataDifference: 36586.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 603.1ms, InitialAbstractionConstructionTime: 10.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 347 SDtfs, 127 SDslu, 817 SDs, 0 SdLazy, 332 SolverSat, 90 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 33555.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 690.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 118.2ms AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 17 LocationsWithAnnotation, 81 PreInvPairs, 93 NumberOfFragments, 491 HoareAnnotationTreeSize, 81 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 70.9ms HoareSimplificationTime, 17 FomulaSimplificationsInter, 419 FormulaSimplificationTreeSizeReductionInter, 519.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 91.3ms SsaConstructionTime, 369.9ms SatisfiabilityAnalysisTime, 1263.5ms InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 12 NumberOfNonLiveVariables, 745 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 9/13 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: 30]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || ((((n == r && n % 4294967296 < 1073741823) && 1 <= counter) && h == 0) && p == 0)) || (((((n == r && n % 4294967296 < 1073741823) && h == 0) && p == 0) && q == 1) && 0 <= counter)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! Received shutdown request...