/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:38:47,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:38:47,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:38:47,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:38:47,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:38:47,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:38:47,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:38:47,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:38:47,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:38:47,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:38:47,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:38:47,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:38:47,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:38:47,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:38:47,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:38:47,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:38:47,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:38:47,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:38:47,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:38:47,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:38:47,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:38:47,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:38:47,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:38:47,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:38:47,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:38:47,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:38:47,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:38:47,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:38:47,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:38:47,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:38:47,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:38:47,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:38:47,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:38:47,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:38:47,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:38:47,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:38:47,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:38:47,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:38:47,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:38:47,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:38:47,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:38:47,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:38:47,933 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:38:47,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:38:47,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:38:47,936 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:38:47,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:38:47,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:38:47,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:38:47,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:38:47,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:38:47,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:38:47,937 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:38:47,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:38:47,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:38:47,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:38:47,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:38:47,939 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:38:47,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:38:47,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:38:47,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:47,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:38:47,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:38:47,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:38:47,940 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:38:48,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:38:48,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:38:48,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:38:48,424 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:38:48,425 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:38:48,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2020-10-24 02:38:48,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dac4886e/ced337f0b49847d5b808f6bbbfd556ff/FLAGf7cd772a5 [2020-10-24 02:38:49,209 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:38:49,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2020-10-24 02:38:49,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dac4886e/ced337f0b49847d5b808f6bbbfd556ff/FLAGf7cd772a5 [2020-10-24 02:38:49,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dac4886e/ced337f0b49847d5b808f6bbbfd556ff [2020-10-24 02:38:49,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:38:49,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:38:49,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:49,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:38:49,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:38:49,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c9c818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49, skipping insertion in model container [2020-10-24 02:38:49,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:38:49,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:38:49,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:49,822 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:38:49,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:49,868 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:38:49,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49 WrapperNode [2020-10-24 02:38:49,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:49,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:38:49,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:38:49,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:38:49,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (1/1) ... [2020-10-24 02:38:49,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:38:49,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:38:49,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:38:49,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:38:49,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (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 [2020-10-24 02:38:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:38:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:38:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:38:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:38:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:38:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:38:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:38:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:38:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:38:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:38:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:38:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:38:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:38:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:38:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:38:50,571 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:38:50,571 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 02:38:50,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:50 BoogieIcfgContainer [2020-10-24 02:38:50,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:38:50,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:38:50,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:38:50,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:38:50,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:49" (1/3) ... [2020-10-24 02:38:50,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de0d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:50, skipping insertion in model container [2020-10-24 02:38:50,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:49" (2/3) ... [2020-10-24 02:38:50,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de0d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:50, skipping insertion in model container [2020-10-24 02:38:50,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:50" (3/3) ... [2020-10-24 02:38:50,590 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2020-10-24 02:38:50,608 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:38:50,615 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:38:50,642 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:38:50,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:38:50,683 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:38:50,683 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:38:50,683 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:38:50,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:38:50,684 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:38:50,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:38:50,684 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:38:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-10-24 02:38:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-24 02:38:50,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:50,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:50,735 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash -77608749, now seen corresponding path program 1 times [2020-10-24 02:38:50,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:50,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948233438] [2020-10-24 02:38:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:51,849 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-10-24 02:38:51,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:52,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948233438] [2020-10-24 02:38:52,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:52,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-24 02:38:52,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053967764] [2020-10-24 02:38:52,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 02:38:52,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 02:38:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:38:52,064 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 15 states. [2020-10-24 02:38:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:55,609 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2020-10-24 02:38:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:38:55,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2020-10-24 02:38:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:55,625 INFO L225 Difference]: With dead ends: 124 [2020-10-24 02:38:55,625 INFO L226 Difference]: Without dead ends: 78 [2020-10-24 02:38:55,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:38:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-24 02:38:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2020-10-24 02:38:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-24 02:38:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2020-10-24 02:38:55,711 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2020-10-24 02:38:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:55,712 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2020-10-24 02:38:55,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 02:38:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2020-10-24 02:38:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-24 02:38:55,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:55,717 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:55,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:38:55,718 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -447719508, now seen corresponding path program 1 times [2020-10-24 02:38:55,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:55,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2018261561] [2020-10-24 02:38:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:38:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:56,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2018261561] [2020-10-24 02:38:56,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:56,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:56,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129892547] [2020-10-24 02:38:56,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:56,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:56,025 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 5 states. [2020-10-24 02:38:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:56,642 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2020-10-24 02:38:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:56,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-10-24 02:38:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:56,645 INFO L225 Difference]: With dead ends: 95 [2020-10-24 02:38:56,646 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 02:38:56,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 02:38:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2020-10-24 02:38:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-24 02:38:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2020-10-24 02:38:56,694 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2020-10-24 02:38:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:56,694 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2020-10-24 02:38:56,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2020-10-24 02:38:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-24 02:38:56,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:56,697 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:56,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:38:56,697 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1452038179, now seen corresponding path program 1 times [2020-10-24 02:38:56,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:56,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831004443] [2020-10-24 02:38:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:56,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:56,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:38:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:56,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831004443] [2020-10-24 02:38:56,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:56,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:56,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713911176] [2020-10-24 02:38:56,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:56,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:56,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:56,949 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2020-10-24 02:38:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:57,568 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2020-10-24 02:38:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:57,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-10-24 02:38:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:57,572 INFO L225 Difference]: With dead ends: 85 [2020-10-24 02:38:57,572 INFO L226 Difference]: Without dead ends: 62 [2020-10-24 02:38:57,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-24 02:38:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-10-24 02:38:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 02:38:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2020-10-24 02:38:57,621 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 45 [2020-10-24 02:38:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:57,621 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2020-10-24 02:38:57,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2020-10-24 02:38:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 02:38:57,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:57,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:57,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:38:57,629 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1245039122, now seen corresponding path program 1 times [2020-10-24 02:38:57,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:57,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281193920] [2020-10-24 02:38:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,106 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2020-10-24 02:38:58,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:38:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:58,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281193920] [2020-10-24 02:38:58,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:58,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:38:58,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348832924] [2020-10-24 02:38:58,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:38:58,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:38:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:38:58,419 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 9 states. [2020-10-24 02:38:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:59,293 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2020-10-24 02:38:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:38:59,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-10-24 02:38:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:59,295 INFO L225 Difference]: With dead ends: 93 [2020-10-24 02:38:59,296 INFO L226 Difference]: Without dead ends: 70 [2020-10-24 02:38:59,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:38:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-24 02:38:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2020-10-24 02:38:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 02:38:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2020-10-24 02:38:59,352 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 46 [2020-10-24 02:38:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:59,353 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2020-10-24 02:38:59,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:38:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-10-24 02:38:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 02:38:59,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:59,362 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:59,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:38:59,362 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 153090441, now seen corresponding path program 1 times [2020-10-24 02:38:59,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:59,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520656664] [2020-10-24 02:38:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:38:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:59,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520656664] [2020-10-24 02:38:59,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:59,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:59,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194210944] [2020-10-24 02:38:59,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:59,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:59,575 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2020-10-24 02:38:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:59,975 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2020-10-24 02:38:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:59,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-10-24 02:38:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:59,980 INFO L225 Difference]: With dead ends: 92 [2020-10-24 02:38:59,981 INFO L226 Difference]: Without dead ends: 69 [2020-10-24 02:38:59,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-24 02:39:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-10-24 02:39:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 02:39:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-10-24 02:39:00,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 47 [2020-10-24 02:39:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:00,017 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-10-24 02:39:00,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-10-24 02:39:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:39:00,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:00,019 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:00,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:39:00,019 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1692474488, now seen corresponding path program 1 times [2020-10-24 02:39:00,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:00,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834961656] [2020-10-24 02:39:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:00,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:00,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:00,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834961656] [2020-10-24 02:39:00,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:00,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:00,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055235448] [2020-10-24 02:39:00,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:00,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:00,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:00,404 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2020-10-24 02:39:00,795 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-24 02:39:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:05,460 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2020-10-24 02:39:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:39:05,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-10-24 02:39:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:05,463 INFO L225 Difference]: With dead ends: 88 [2020-10-24 02:39:05,464 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 02:39:05,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:39:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 02:39:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-10-24 02:39:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 02:39:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2020-10-24 02:39:05,495 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2020-10-24 02:39:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:05,495 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2020-10-24 02:39:05,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2020-10-24 02:39:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 02:39:05,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:05,497 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:05,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:39:05,498 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1096172817, now seen corresponding path program 1 times [2020-10-24 02:39:05,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:05,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116301258] [2020-10-24 02:39:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:05,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:05,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:05,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [116301258] [2020-10-24 02:39:05,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:05,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:05,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608465224] [2020-10-24 02:39:05,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:05,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:05,629 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 5 states. [2020-10-24 02:39:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:05,984 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-10-24 02:39:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:05,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-24 02:39:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:05,988 INFO L225 Difference]: With dead ends: 90 [2020-10-24 02:39:05,989 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 02:39:05,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 02:39:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-10-24 02:39:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 02:39:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2020-10-24 02:39:06,016 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 49 [2020-10-24 02:39:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:06,016 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2020-10-24 02:39:06,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2020-10-24 02:39:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 02:39:06,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:06,034 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:06,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:39:06,035 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1795165361, now seen corresponding path program 1 times [2020-10-24 02:39:06,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:06,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [295422387] [2020-10-24 02:39:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,615 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-10-24 02:39:06,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:06,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [295422387] [2020-10-24 02:39:06,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:06,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 02:39:06,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428167403] [2020-10-24 02:39:06,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 02:39:06,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 02:39:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:39:06,721 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 17 states. [2020-10-24 02:39:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:08,399 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2020-10-24 02:39:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 02:39:08,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2020-10-24 02:39:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:08,402 INFO L225 Difference]: With dead ends: 105 [2020-10-24 02:39:08,403 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 02:39:08,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2020-10-24 02:39:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 02:39:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2020-10-24 02:39:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 02:39:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2020-10-24 02:39:08,454 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 49 [2020-10-24 02:39:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:08,457 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2020-10-24 02:39:08,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 02:39:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-10-24 02:39:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 02:39:08,459 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:08,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:08,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:39:08,460 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2144483504, now seen corresponding path program 2 times [2020-10-24 02:39:08,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:08,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918018184] [2020-10-24 02:39:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:09,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918018184] [2020-10-24 02:39:09,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:09,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:09,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613106541] [2020-10-24 02:39:09,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:09,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:09,018 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2020-10-24 02:39:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:10,002 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2020-10-24 02:39:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:10,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-10-24 02:39:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:10,004 INFO L225 Difference]: With dead ends: 109 [2020-10-24 02:39:10,005 INFO L226 Difference]: Without dead ends: 86 [2020-10-24 02:39:10,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:39:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-24 02:39:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2020-10-24 02:39:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 02:39:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-10-24 02:39:10,074 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 58 [2020-10-24 02:39:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:10,075 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-10-24 02:39:10,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-10-24 02:39:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 02:39:10,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:10,078 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:10,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:39:10,078 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 205952927, now seen corresponding path program 1 times [2020-10-24 02:39:10,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:10,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869033811] [2020-10-24 02:39:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:10,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869033811] [2020-10-24 02:39:10,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:10,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:10,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595956784] [2020-10-24 02:39:10,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:10,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:10,638 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 11 states. [2020-10-24 02:39:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:21,438 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2020-10-24 02:39:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:39:21,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-10-24 02:39:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:21,441 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:39:21,441 INFO L226 Difference]: Without dead ends: 84 [2020-10-24 02:39:21,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:39:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-24 02:39:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2020-10-24 02:39:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 02:39:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-10-24 02:39:21,475 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 59 [2020-10-24 02:39:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:21,475 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-10-24 02:39:21,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-10-24 02:39:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 02:39:21,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:21,476 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:21,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:39:21,477 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1271101974, now seen corresponding path program 1 times [2020-10-24 02:39:21,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:21,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936853433] [2020-10-24 02:39:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:21,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936853433] [2020-10-24 02:39:21,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:21,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:21,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248636408] [2020-10-24 02:39:21,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:21,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:21,977 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 10 states. [2020-10-24 02:39:22,394 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-24 02:39:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:23,093 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-10-24 02:39:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:23,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2020-10-24 02:39:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:23,096 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:39:23,096 INFO L226 Difference]: Without dead ends: 84 [2020-10-24 02:39:23,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:39:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-24 02:39:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2020-10-24 02:39:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-24 02:39:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-10-24 02:39:23,124 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 60 [2020-10-24 02:39:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:23,124 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-10-24 02:39:23,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-10-24 02:39:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 02:39:23,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:23,126 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:23,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:39:23,126 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 961038853, now seen corresponding path program 1 times [2020-10-24 02:39:23,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:23,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1353735747] [2020-10-24 02:39:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:23,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1353735747] [2020-10-24 02:39:23,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:23,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:23,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292722055] [2020-10-24 02:39:23,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:23,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:23,276 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2020-10-24 02:39:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:23,812 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2020-10-24 02:39:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:23,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-10-24 02:39:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:23,814 INFO L225 Difference]: With dead ends: 106 [2020-10-24 02:39:23,815 INFO L226 Difference]: Without dead ends: 83 [2020-10-24 02:39:23,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-24 02:39:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-10-24 02:39:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 02:39:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2020-10-24 02:39:23,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 61 [2020-10-24 02:39:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:23,850 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2020-10-24 02:39:23,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2020-10-24 02:39:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 02:39:23,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:23,851 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:23,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:39:23,852 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 969071484, now seen corresponding path program 1 times [2020-10-24 02:39:23,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:23,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857608991] [2020-10-24 02:39:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:24,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857608991] [2020-10-24 02:39:24,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:24,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:24,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663236958] [2020-10-24 02:39:24,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:24,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:24,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:24,405 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2020-10-24 02:39:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:58,199 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2020-10-24 02:39:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:58,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2020-10-24 02:39:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:58,201 INFO L225 Difference]: With dead ends: 105 [2020-10-24 02:39:58,202 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 02:39:58,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:39:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 02:39:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2020-10-24 02:39:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-24 02:39:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-10-24 02:39:58,237 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 62 [2020-10-24 02:39:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:58,237 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-10-24 02:39:58,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-10-24 02:39:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 02:39:58,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:58,239 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:58,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:39:58,239 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2046829461, now seen corresponding path program 1 times [2020-10-24 02:39:58,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:58,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883357267] [2020-10-24 02:39:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:58,905 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2020-10-24 02:39:58,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:58,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:39:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:58,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:39:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:59,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883357267] [2020-10-24 02:39:59,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:59,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 02:39:59,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089390054] [2020-10-24 02:39:59,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 02:39:59,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 02:39:59,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:39:59,020 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 19 states. [2020-10-24 02:40:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:01,055 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2020-10-24 02:40:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 02:40:01,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2020-10-24 02:40:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:01,058 INFO L225 Difference]: With dead ends: 133 [2020-10-24 02:40:01,058 INFO L226 Difference]: Without dead ends: 130 [2020-10-24 02:40:01,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 02:40:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-24 02:40:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2020-10-24 02:40:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-24 02:40:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2020-10-24 02:40:01,095 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 63 [2020-10-24 02:40:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:01,095 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2020-10-24 02:40:01,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 02:40:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2020-10-24 02:40:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 02:40:01,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:01,098 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:01,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:40:01,099 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash -844050668, now seen corresponding path program 2 times [2020-10-24 02:40:01,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:01,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109889896] [2020-10-24 02:40:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:01,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:01,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:01,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:01,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:01,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109889896] [2020-10-24 02:40:01,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:01,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:40:01,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019863083] [2020-10-24 02:40:01,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:40:01,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:01,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:40:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:40:01,598 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 10 states. [2020-10-24 02:40:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:02,802 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2020-10-24 02:40:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:40:02,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2020-10-24 02:40:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:02,804 INFO L225 Difference]: With dead ends: 141 [2020-10-24 02:40:02,804 INFO L226 Difference]: Without dead ends: 100 [2020-10-24 02:40:02,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:40:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-24 02:40:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2020-10-24 02:40:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-24 02:40:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2020-10-24 02:40:02,838 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 72 [2020-10-24 02:40:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:02,838 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2020-10-24 02:40:02,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:40:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-10-24 02:40:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 02:40:02,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:02,840 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:02,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:40:02,840 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2050674107, now seen corresponding path program 1 times [2020-10-24 02:40:02,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:02,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66680205] [2020-10-24 02:40:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:05,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:05,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:05,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:05,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:05,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66680205] [2020-10-24 02:40:05,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:05,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:05,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021314283] [2020-10-24 02:40:05,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:05,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2020-10-24 02:40:05,138 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 7 states. [2020-10-24 02:40:07,465 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 59 [2020-10-24 02:40:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:14,318 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2020-10-24 02:40:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:40:14,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2020-10-24 02:40:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:14,320 INFO L225 Difference]: With dead ends: 136 [2020-10-24 02:40:14,321 INFO L226 Difference]: Without dead ends: 113 [2020-10-24 02:40:14,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=39, Invalid=92, Unknown=1, NotChecked=0, Total=132 [2020-10-24 02:40:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-24 02:40:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2020-10-24 02:40:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-24 02:40:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2020-10-24 02:40:14,366 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 73 [2020-10-24 02:40:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:14,367 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2020-10-24 02:40:14,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2020-10-24 02:40:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 02:40:14,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:14,368 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:14,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:40:14,368 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1672083590, now seen corresponding path program 1 times [2020-10-24 02:40:14,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:14,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976217935] [2020-10-24 02:40:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:14,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:14,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:14,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:14,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:14,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976217935] [2020-10-24 02:40:14,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:14,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:40:14,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986304307] [2020-10-24 02:40:14,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:14,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:14,652 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 7 states. [2020-10-24 02:40:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:15,421 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2020-10-24 02:40:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:40:15,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-10-24 02:40:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:15,423 INFO L225 Difference]: With dead ends: 165 [2020-10-24 02:40:15,423 INFO L226 Difference]: Without dead ends: 119 [2020-10-24 02:40:15,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-24 02:40:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2020-10-24 02:40:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-24 02:40:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2020-10-24 02:40:15,473 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 74 [2020-10-24 02:40:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:15,473 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2020-10-24 02:40:15,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2020-10-24 02:40:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 02:40:15,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:15,475 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:15,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:40:15,475 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1343774752, now seen corresponding path program 1 times [2020-10-24 02:40:15,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:15,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174824139] [2020-10-24 02:40:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:16,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:16,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:16,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:16,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:40:16,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174824139] [2020-10-24 02:40:16,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:16,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 02:40:16,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417129669] [2020-10-24 02:40:16,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 02:40:16,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 02:40:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-10-24 02:40:16,239 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 21 states. [2020-10-24 02:40:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:18,888 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2020-10-24 02:40:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:40:18,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2020-10-24 02:40:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:18,891 INFO L225 Difference]: With dead ends: 203 [2020-10-24 02:40:18,891 INFO L226 Difference]: Without dead ends: 200 [2020-10-24 02:40:18,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 02:40:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-24 02:40:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2020-10-24 02:40:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-24 02:40:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2020-10-24 02:40:18,957 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 76 [2020-10-24 02:40:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:18,957 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2020-10-24 02:40:18,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 02:40:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2020-10-24 02:40:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-24 02:40:18,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:18,959 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:18,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:40:18,959 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1852120895, now seen corresponding path program 2 times [2020-10-24 02:40:18,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:18,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412210449] [2020-10-24 02:40:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:19,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412210449] [2020-10-24 02:40:19,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:19,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:40:19,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880863316] [2020-10-24 02:40:19,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:40:19,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:40:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:19,636 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand 11 states. [2020-10-24 02:40:19,951 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2020-10-24 02:40:20,172 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-24 02:40:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:21,386 INFO L93 Difference]: Finished difference Result 214 states and 263 transitions. [2020-10-24 02:40:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:40:21,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2020-10-24 02:40:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:21,388 INFO L225 Difference]: With dead ends: 214 [2020-10-24 02:40:21,389 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 02:40:21,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:40:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 02:40:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 02:40:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 02:40:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2020-10-24 02:40:21,454 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 85 [2020-10-24 02:40:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:21,455 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2020-10-24 02:40:21,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:40:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2020-10-24 02:40:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-24 02:40:21,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:21,457 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:21,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:40:21,457 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -267353360, now seen corresponding path program 1 times [2020-10-24 02:40:21,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:21,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472296803] [2020-10-24 02:40:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:23,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472296803] [2020-10-24 02:40:23,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:23,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:40:23,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880504492] [2020-10-24 02:40:23,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:40:23,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:40:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2020-10-24 02:40:23,882 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 9 states. [2020-10-24 02:40:26,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (* 1431655765 c_main_~l~0))) (and (<= (let ((.cse2 (div c_main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ c_main_~l~0 .cse1) 6))) (+ (* 6148914694099828736 (div (+ c_main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 8589934592 .cse0) (* 6148914689804861440 .cse2) 1431655764)))) .cse3) (= |c_#t~string5.offset| |c_old(#t~string5.offset)|) (<= .cse3 (+ (* 4294967296 (div (+ (* c_main_~l~0 1431655765) (- 1431655765)) 4294967296)) 1431655765)) (= |c_old(#length)| |c_#length|) (= |c_#t~string6.base| |c_old(#t~string6.base)|) (= c_~SIZE~0 |c_old(~SIZE~0)|) (= |c_#t~string6.offset| |c_old(#t~string6.offset)|) (= |c_#t~string4.offset| |c_old(#t~string4.offset)|) (= |c_old(#valid)| |c_#valid|) (= |c_#t~string5.base| |c_old(#t~string5.base)|) (= |c_#t~string4.base| |c_old(#t~string4.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2020-10-24 02:40:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:43,049 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2020-10-24 02:40:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:40:43,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2020-10-24 02:40:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:43,051 INFO L225 Difference]: With dead ends: 177 [2020-10-24 02:40:43,051 INFO L226 Difference]: Without dead ends: 131 [2020-10-24 02:40:43,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=53, Invalid=131, Unknown=2, NotChecked=24, Total=210 [2020-10-24 02:40:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-24 02:40:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2020-10-24 02:40:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 02:40:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2020-10-24 02:40:43,111 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 86 [2020-10-24 02:40:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:43,111 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2020-10-24 02:40:43,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:40:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2020-10-24 02:40:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-24 02:40:43,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:43,113 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:43,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 02:40:43,113 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -516491035, now seen corresponding path program 1 times [2020-10-24 02:40:43,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:43,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545820955] [2020-10-24 02:40:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:43,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545820955] [2020-10-24 02:40:43,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:43,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:40:43,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115719959] [2020-10-24 02:40:43,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:40:43,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:40:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:40:43,752 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 12 states. [2020-10-24 02:40:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:45,182 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2020-10-24 02:40:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:40:45,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2020-10-24 02:40:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:45,184 INFO L225 Difference]: With dead ends: 175 [2020-10-24 02:40:45,184 INFO L226 Difference]: Without dead ends: 129 [2020-10-24 02:40:45,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:40:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-24 02:40:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2020-10-24 02:40:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 02:40:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2020-10-24 02:40:45,234 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 87 [2020-10-24 02:40:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:45,234 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2020-10-24 02:40:45,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:40:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2020-10-24 02:40:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-24 02:40:45,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:45,235 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:45,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 02:40:45,236 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1380230422, now seen corresponding path program 1 times [2020-10-24 02:40:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:45,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1545967310] [2020-10-24 02:40:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:46,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1545967310] [2020-10-24 02:40:46,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:46,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 02:40:46,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366080544] [2020-10-24 02:40:46,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 02:40:46,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 02:40:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2020-10-24 02:40:46,096 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 23 states. [2020-10-24 02:40:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:48,648 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2020-10-24 02:40:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 02:40:48,651 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2020-10-24 02:40:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:48,652 INFO L225 Difference]: With dead ends: 148 [2020-10-24 02:40:48,652 INFO L226 Difference]: Without dead ends: 145 [2020-10-24 02:40:48,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 02:40:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-24 02:40:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2020-10-24 02:40:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 02:40:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2020-10-24 02:40:48,712 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 88 [2020-10-24 02:40:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:48,713 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2020-10-24 02:40:48,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 02:40:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2020-10-24 02:40:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 02:40:48,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:48,714 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:48,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 02:40:48,715 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:48,715 INFO L82 PathProgramCache]: Analyzing trace with hash 458987209, now seen corresponding path program 2 times [2020-10-24 02:40:48,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:48,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1631219573] [2020-10-24 02:40:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-24 02:40:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:40:49,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1631219573] [2020-10-24 02:40:49,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:49,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:40:49,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799636967] [2020-10-24 02:40:49,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:40:49,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:40:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:40:49,409 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 12 states. [2020-10-24 02:40:49,792 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-10-24 02:40:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:51,037 INFO L93 Difference]: Finished difference Result 191 states and 226 transitions. [2020-10-24 02:40:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:40:51,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2020-10-24 02:40:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:51,039 INFO L225 Difference]: With dead ends: 191 [2020-10-24 02:40:51,039 INFO L226 Difference]: Without dead ends: 145 [2020-10-24 02:40:51,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:40:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-24 02:40:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2020-10-24 02:40:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-24 02:40:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2020-10-24 02:40:51,095 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 97 [2020-10-24 02:40:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:51,095 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2020-10-24 02:40:51,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:40:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2020-10-24 02:40:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-24 02:40:51,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:51,096 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:51,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 02:40:51,096 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 711833071, now seen corresponding path program 1 times [2020-10-24 02:40:51,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:51,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1881204583] [2020-10-24 02:40:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-24 02:40:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:40:51,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1881204583] [2020-10-24 02:40:51,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:51,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 02:40:51,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488366709] [2020-10-24 02:40:51,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 02:40:51,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 02:40:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-10-24 02:40:51,996 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand 25 states. [2020-10-24 02:40:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:56,919 INFO L93 Difference]: Finished difference Result 221 states and 270 transitions. [2020-10-24 02:40:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 02:40:56,920 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2020-10-24 02:40:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:56,922 INFO L225 Difference]: With dead ends: 221 [2020-10-24 02:40:56,922 INFO L226 Difference]: Without dead ends: 218 [2020-10-24 02:40:56,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 02:40:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-24 02:40:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2020-10-24 02:40:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-24 02:40:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2020-10-24 02:40:57,017 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 99 [2020-10-24 02:40:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:57,018 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2020-10-24 02:40:57,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 02:40:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2020-10-24 02:40:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-24 02:40:57,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:57,019 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 02:40:57,020 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 178612752, now seen corresponding path program 2 times [2020-10-24 02:40:57,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:57,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142382824] [2020-10-24 02:40:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:40:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:40:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:40:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:40:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-24 02:40:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 02:40:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 25 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:40:57,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142382824] [2020-10-24 02:40:57,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:57,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:40:57,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165469930] [2020-10-24 02:40:57,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:40:57,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:40:57,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:40:57,762 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand 13 states. [2020-10-24 02:40:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:59,477 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2020-10-24 02:40:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:40:59,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-10-24 02:40:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:59,479 INFO L225 Difference]: With dead ends: 244 [2020-10-24 02:40:59,479 INFO L226 Difference]: Without dead ends: 150 [2020-10-24 02:40:59,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:40:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-24 02:40:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-10-24 02:40:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-24 02:40:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2020-10-24 02:40:59,539 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 108 [2020-10-24 02:40:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:59,540 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2020-10-24 02:40:59,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:40:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2020-10-24 02:40:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-24 02:40:59,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:59,541 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:59,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 02:40:59,541 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash -606498241, now seen corresponding path program 1 times [2020-10-24 02:40:59,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:59,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869960241] [2020-10-24 02:40:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:41:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:41:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-24 02:41:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 02:41:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 12 proven. 119 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:41:00,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869960241] [2020-10-24 02:41:00,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:00,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 02:41:00,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766718866] [2020-10-24 02:41:00,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 02:41:00,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 02:41:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2020-10-24 02:41:00,549 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 27 states. [2020-10-24 02:41:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:03,438 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2020-10-24 02:41:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 02:41:03,439 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2020-10-24 02:41:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:03,440 INFO L225 Difference]: With dead ends: 169 [2020-10-24 02:41:03,440 INFO L226 Difference]: Without dead ends: 166 [2020-10-24 02:41:03,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=418, Invalid=2234, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 02:41:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-24 02:41:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2020-10-24 02:41:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-24 02:41:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2020-10-24 02:41:03,543 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 109 [2020-10-24 02:41:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:03,543 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2020-10-24 02:41:03,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 02:41:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2020-10-24 02:41:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-10-24 02:41:03,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:03,545 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:03,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 02:41:03,545 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash 902064064, now seen corresponding path program 2 times [2020-10-24 02:41:03,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:03,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121747480] [2020-10-24 02:41:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-10-24 02:41:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 02:41:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-10-24 02:41:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 02:41:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 02:41:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 14 proven. 147 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-10-24 02:41:04,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121747480] [2020-10-24 02:41:04,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:04,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 02:41:04,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283934696] [2020-10-24 02:41:04,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 02:41:04,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 02:41:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:41:04,593 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 28 states. [2020-10-24 02:41:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:07,143 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2020-10-24 02:41:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 02:41:07,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2020-10-24 02:41:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:07,151 INFO L225 Difference]: With dead ends: 155 [2020-10-24 02:41:07,151 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:41:07,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=431, Invalid=2221, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 02:41:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:41:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:41:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:41:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:41:07,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2020-10-24 02:41:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:07,154 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:41:07,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 02:41:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:41:07,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:41:07,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 02:41:07,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:41:07,466 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 285 [2020-10-24 02:41:07,859 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 243 [2020-10-24 02:41:08,251 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 271 [2020-10-24 02:41:08,764 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 264 [2020-10-24 02:41:09,111 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 277 [2020-10-24 02:41:09,412 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 97 [2020-10-24 02:41:09,563 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 303 [2020-10-24 02:41:09,780 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 207 [2020-10-24 02:41:09,894 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 298 [2020-10-24 02:41:10,135 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 300 [2020-10-24 02:41:10,487 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 250 [2020-10-24 02:41:10,777 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 143 [2020-10-24 02:41:11,027 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 124 [2020-10-24 02:41:11,375 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 19 [2020-10-24 02:41:18,617 WARN L193 SmtUtils]: Spent 7.24 s on a formula simplification. DAG size of input: 230 DAG size of output: 45 [2020-10-24 02:41:18,729 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-10-24 02:41:19,588 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 36 [2020-10-24 02:41:19,893 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 21 [2020-10-24 02:41:22,798 WARN L193 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 263 DAG size of output: 37 [2020-10-24 02:41:22,955 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2020-10-24 02:41:23,062 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-10-24 02:41:23,168 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-10-24 02:41:23,423 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-10-24 02:41:23,740 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 19 [2020-10-24 02:41:26,627 WARN L193 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 196 DAG size of output: 45 [2020-10-24 02:41:28,961 WARN L193 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 281 DAG size of output: 19 [2020-10-24 02:41:29,465 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 37 [2020-10-24 02:41:31,843 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 273 DAG size of output: 19 [2020-10-24 02:41:32,025 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-10-24 02:41:32,287 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 36 [2020-10-24 02:41:33,102 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 37 [2020-10-24 02:41:33,240 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 36 [2020-10-24 02:41:33,246 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,246 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,246 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,246 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L270 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:33,247 INFO L270 CegarLoopResult]: 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)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 02:41:33,247 INFO L270 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:33,248 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:41:33,248 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:33,248 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:41:33,248 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:41:33,248 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:33,248 INFO L274 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-10-24 02:41:33,248 INFO L274 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-10-24 02:41:33,248 INFO L274 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:33,248 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:33,248 INFO L270 CegarLoopResult]: At program point L31(lines 31 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L27(lines 27 36) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,249 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 16 41) the Hoare annotation is: true [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L23(lines 23 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,249 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L33(lines 33 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,250 INFO L270 CegarLoopResult]: At program point L33-2(lines 23 36) the Hoare annotation is: (or (let ((.cse1 (+ main_~l~0 1)) (.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,251 INFO L270 CegarLoopResult]: At program point L29(lines 29 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 .cse3)))) [2020-10-24 02:41:33,251 INFO L270 CegarLoopResult]: At program point L25(lines 25 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-10-24 02:41:33,251 INFO L277 CegarLoopResult]: At program point L21-2(lines 21 39) the Hoare annotation is: true [2020-10-24 02:41:33,251 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 02:41:33,251 INFO L270 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,251 INFO L270 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,251 INFO L270 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,252 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 16 41) the Hoare annotation is: true [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L38-1(lines 21 39) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0)))) [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 3))) (+ (* 3 .cse0) (* 4294967298 (div (+ (* .cse0 (- 3)) main_~l~0 .cse1) 4294967296)) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= .cse3 main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,252 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 16 41) the Hoare annotation is: true [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~v1~0 main_~k~0 main_~v2~0 main_~v3~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,252 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-10-24 02:41:33,253 INFO L270 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:33,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:41:33 BoogieIcfgContainer [2020-10-24 02:41:33,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:41:33,280 INFO L168 Benchmark]: Toolchain (without parser) took 163707.48 ms. Allocated memory was 158.3 MB in the beginning and 235.9 MB in the end (delta: 77.6 MB). Free memory was 134.4 MB in the beginning and 89.6 MB in the end (delta: 44.8 MB). Peak memory consumption was 137.7 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:33,281 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 158.3 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:41:33,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.44 ms. Allocated memory is still 158.3 MB. Free memory was 133.8 MB in the beginning and 124.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:33,282 INFO L168 Benchmark]: Boogie Preprocessor took 51.85 ms. Allocated memory is still 158.3 MB. Free memory was 124.0 MB in the beginning and 122.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:33,282 INFO L168 Benchmark]: RCFGBuilder took 651.98 ms. Allocated memory is still 158.3 MB. Free memory was 122.5 MB in the beginning and 140.5 MB in the end (delta: -18.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:33,283 INFO L168 Benchmark]: TraceAbstraction took 162698.06 ms. Allocated memory was 158.3 MB in the beginning and 235.9 MB in the end (delta: 77.6 MB). Free memory was 140.5 MB in the beginning and 89.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 142.2 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:33,285 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.30 ms. Allocated memory is still 158.3 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 285.44 ms. Allocated memory is still 158.3 MB. Free memory was 133.8 MB in the beginning and 124.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.85 ms. Allocated memory is still 158.3 MB. Free memory was 124.0 MB in the beginning and 122.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 651.98 ms. Allocated memory is still 158.3 MB. Free memory was 122.5 MB in the beginning and 140.5 MB in the end (delta: -18.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 162698.06 ms. Allocated memory was 158.3 MB in the beginning and 235.9 MB in the end (delta: 77.6 MB). Free memory was 140.5 MB in the beginning and 89.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 142.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(SIZE <= 20000001) || !(20000001 <= SIZE)) || (i + j + v1 + k + v2 + v3 + v4 <= l && l <= i + j + v1 + k + v2 + v3 + v4) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || !(SIZE <= 20000001)) || !(cond == 0)) || !(20000001 <= SIZE) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 136.4s, OverallIterations: 27, TraceHistogramMax: 8, AutomataDifference: 115.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1066 SDtfs, 4475 SDslu, 2659 SDs, 0 SdLazy, 9026 SolverSat, 943 SolverUnsat, 32 SolverUnknown, 0 SolverNotchecked, 85.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 241 SyntacticMatches, 16 SemanticMatches, 538 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 315 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 58 LocationsWithAnnotation, 480 PreInvPairs, 607 NumberOfFragments, 1377 HoareAnnotationTreeSize, 480 FomulaSimplifications, 848007908 FormulaSimplificationTreeSizeReduction, 3.8s HoareSimplificationTime, 58 FomulaSimplificationsInter, 649556 FormulaSimplificationTreeSizeReductionInter, 22.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 1898 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 707/1638 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...